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

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.

BibTeX

@misc{reference.wolfram_2021_maximumspanningtree, author="Wolfram Research", title="{MaximumSpanningTree}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html}", note=[Accessed: 26-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_maximumspanningtree, organization={Wolfram Research}, title={MaximumSpanningTree}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/MaximumSpanningTree.html}, note=[Accessed: 26-September-2021 ]}

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