二分图

The theory involved takes its reference from the Matching of Bipartite Graph theory.

问题的理论部分来自于图论的二分图匹配。

Weak distance-transitivity of non-bipartite graphs is also obtained.

讨论了非二分图的弱距离传递性。

Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.

然后，该算法被扩展来处理特殊的二分图查询。

An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

提出了一种改进的基于二分图完美匹配的布尔匹配算法。

For each test case, output the maximum number of edges Soda can add.

题意，给个二分图，要求添加最多的边形成一个完全二分图。