Minimum Spanning Tree Demonstration

Minimum Spanning Tree Demonstration Program

A spanning tree of a connected graph is a connected subgraph without a cycle.
A minimum spanning tree of a connected graph is a spanning tree such that the total cost of the edges in the tree is smallest.
Telephone cables between rural cities may be laid out to form a minimum spanning tree.
Edges are insertion sorted as they are added to the edge collection.