xysq Speaker:
Points by double and double edge codes:
All points were stained, if there is a program that adjacent dots of different colors, then he is a bipartite graph.
Two Calculations bipartite graph, 1, dfs augmenting path seeking.
2, network flow: maximum flow = minimum cut
Differential constraints:
Afternoon exam again. . . . .
Explosion zero spicy!