资 源 简 介
寻找二分图的最大匹配
程序通过一个二维的数组给出二分图，让后找出一个初始的匹配，通过初始匹配
找出最大匹配。
-Bipartite graph to find the maximum matching program through a two-dimensional array is given bipartite graph, so that after the initial find a match, the adoption of the initial match to find the greatest match.
