三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及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.