Minimum Spanning Tree -- from Wolfram MathWorld

The minimum spanning tree of a weighted graph is a set of n-1 edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree is a minimum spanning tree. The minimum spanning tree can be found in ...

mathworld.wolfram.com