Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph.

• 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。