Combinatorica`
Combinatorica`
BipartiteMatching
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
BipartiteMatching[g]
gives the list of edges associated with a maximum matching in bipartite graph g. If the graph is edge weighted, then the function returns a matching with maximum total weight.
更多信息和选项
- BipartiteMatching functionality is now available in the built-in Wolfram Language function FindIndependentEdgeSet.
- To use BipartiteMatching, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
BipartiteMatching has been superseded by FindIndependentEdgeSet:
Wolfram Research (2012)，BipartiteMatching，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.
文本
Wolfram Research (2012)，BipartiteMatching，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.
CMS
Wolfram 语言. 2012. "BipartiteMatching." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.
APA
Wolfram 语言. (2012). BipartiteMatching. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html 年