COMBINATORICA 程序包符号

MaximumSpanningTree

MaximumSpanningTree[g]
uses Kruskal's algorithm to find a maximum spanning tree of graph g.

更多信息 更多信息

To use , you first need to load the Combinatorica Package using Needs["Combinatorica`"].

参见 参见

MinimumSpanningTree NumberOfSpanningTrees

教程 教程

Combinatorica

相关指南 相关指南

Graph Algorithms

Mathematica 9 is now available!

400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »

Try Now

Buy/Upgrade

New to Mathematica? Find your learning path »

Have a question? Ask support »

© 2013 About Wolfram