A spanning tree of a graph is a collection of connected edges that include every vertex in the graph, but that do not form a cycle. Many such spanning trees may exist for a graph. The Minimum Spanning Tree is the one whose cumulative edge weights have the smallest value, however. Think of it as the least cost path that goes through the entire graph and touches every vertex.

Check other topic for the minimum spanning tree algorithm. They are all important.

Back to AlgoNet Home