Now, the plan for the bipartite graph is probably finished.
The general question types are roughly divided into the following categories:
1. Determine the bipartite graph (this type of question is very interesting, often because there is a feeling of body filling)
2. The maximum matching (minimum) of a bipartite graph is the most frequently used topic with other algorithms (floyed, passing closure, binary ......)
3. Maximum right matching: this type of question is a weighted bipartite graph.
4. Multi-configuration matching. Faster than network streams
5. The maximum vertex is independent. There are many such types
6. The minimum path covers N-the maximum matching HLG and the questions from Zhou.
Now I think of these types of questions, and I will come back to supplement them later,
In addition, I have completed all the previous questions in the competition.
The system learning bipartite graph is about to come to an end.
Connection to competition questions:
Http://vjudge.net/vjudge/contest/view.action? Cid = 53855 # OVERVIEW
Bipartite Graph Summary