Combinatorica`
Combinatorica`
MinimumSpanningTree
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
MinimumSpanningTree[g]
uses Kruskal's algorithm to find a minimum spanning tree of graph g.
更多信息和选项
- MinimumSpanningTree functionality is now available in the built-in Wolfram Language function FindSpanningTree.
- To use MinimumSpanningTree, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
Wolfram Research (2012)，MinimumSpanningTree，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
文本
Wolfram Research (2012)，MinimumSpanningTree，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
CMS
Wolfram 语言. 2012. "MinimumSpanningTree." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
APA
Wolfram 语言. (2012). MinimumSpanningTree. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html 年