参考链接： https://zhuanlan.zhihu.com/p/96229700

Bipartite Graph

Definition

1. G = （U, V, E）
2. all the edges are between U and V.
3. No edge between two vertices in U.
4. 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