BipartiteMatchingAndCover

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

BipartiteMatchingAndCover[g]
takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is assumed that all edge weights are 1.

更多信息更多信息