MaximumSpanningTree[g]
uses Kruskal's algorithm to find a maximum spanning tree of graph g.
MaximumSpanningTree
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`"].
Tech Notes
Related Guides
-
▪
- Graph Algorithms ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
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
BibTeX
@misc{reference.wolfram_2025_maximumspanningtree, author="Wolfram Research", title="{MaximumSpanningTree}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html}", note=[Accessed: 04-December-2025]}
BibLaTeX
@online{reference.wolfram_2025_maximumspanningtree, organization={Wolfram Research}, title={MaximumSpanningTree}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html}, note=[Accessed: 04-December-2025]}