MinimumSpanningTree
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.
Details and Options
- 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 Language function, https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
Text
Wolfram Research (2012), MinimumSpanningTree, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
CMS
Wolfram Language. 2012. "MinimumSpanningTree." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.
APA
Wolfram Language. (2012). MinimumSpanningTree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html