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

Examples

Basic Examples  (2)

MinimumSpanningTree has been superseded by FindSpanningTree: