Minimum Spanning Tree
Jump to navigation Jump to search
|This is a stub or unfinished. Contribute by editing me.|
Consider an undirected graph with edge costs. A minimal spanning tree on is a spanning tree such that the sum of its edges is as small as possible. Such an MST is not necessarily unique.