MaximumSpanningTree
Combinatorica`
Combinatorica`
MaximumSpanningTree
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
MaximumSpanningTree[g]
uses Kruskal's algorithm to find a maximum spanning tree of graph g.
Details and Options
- MaximumSpanningTree functionality is now available in the built-in Wolfram Language function FindSpanningTree.
- To use MaximumSpanningTree, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012), MaximumSpanningTree, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html.
Text
Wolfram Research (2012), MaximumSpanningTree, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html.
CMS
Wolfram Language. 2012. "MaximumSpanningTree." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html.
APA
Wolfram Language. (2012). MaximumSpanningTree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html