PRODUCTS
Mathematica
Mathematica for Students
Mathematica for the Classroom
grid
Mathematica
web
Mathematica
Mathematica Player
(free download)
Mathematica Player Pro
Wolfram
Workbench
Mathematica
Applications
PURCHASE
Online Store
Other Ways to Buy
Volume & Site Licensing
Contact Sales
Software
Service
Upgrades
Training
Books
FOR USERS
All User Resources
Product Registration
Technical Support
Customer Service
Developer Support
Does My Site Have a License?
Free Seminars
Certified Training
Custom Group Seminars
Documentation & Examples
Tutorial Screencasts
Video Gallery
Demonstrations Project
Education Portal
Student Resources
COMPANY
About Wolfram Research
News & Events
Wolfram Blog
Employment Opportunities
History of
Mathematica
Stephen Wolfram's Home Page
Contact Us
OUR SITES
Demonstrations Project
MathWorld
Integrator
Wolfram Functions Site
Wolfram Blog
Mathematica Journal
Wolfram Library Archive
Wolfram
Tones
Wolfram Science
Stephen Wolfram
DOCUMENTATION CENTER SEARCH
Combinatorica Package
>
Combinatorica
Package Symbol
Combinatorica
Tutorials »
|
MaximumSpanningTree
NumberOfSpanningTrees
ShortestPathSpanningTree
See Also »
|
Graph Algorithms
Combinatorica
Package
More About »
MinimumSpanningTree
MinimumSpanningTree[
g
]
uses Kruskal's algorithm to find a minimum spanning tree of graph
.
MORE INFORMATION
To use
MinimumSpanningTree
, you first need to load the
Combinatorica
Package
using
Needs
["Combinatorica`"]
.
SEE ALSO
MaximumSpanningTree
NumberOfSpanningTrees
ShortestPathSpanningTree
TUTORIALS
Combinatorica
MORE ABOUT
Graph Algorithms
Combinatorica
Package
© 2008 Wolfram Research, Inc.
