Combinatorica Package >

MinimumSpanningTree

MinimumSpanningTree[g]
uses Kruskal's algorithm to find a minimum spanning tree of graph .
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF