参考链接： https://zhuanlan.zhihu.com/p/96229700
Bipartite Graph
Definition
- G = （U, V, E）
- all the edges are between U and V.
- No edge between two vertices in U.
- No edge between two vertices in V.
Bipartite Matching
- G = (U, V, E).
- Matching is a subset of edges without common vertices.
- Denote the matching by set S subset under E
