二分图的最大匹配，非常好的资料。这是我辛勤找来的。-Bipartite graph of maximum matching, very good information. This is what I found the hard.

三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm

Hopcroft算法，实现难度中等，以高效率实现二分匹配，学习算法的同学们可以参考。-Hopcroft algorithm, with medium difficulty to achieve， perform high efficiency bipartite matching. Students learning algorithms may refer to it.

匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the core of the algorithm is to fi