Minimum Spanning Tree

From Progteam

Revision as of 15:01, 27 February 2007 by Hjfreyer (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Given a graph with weighted edges, that graph's Minimum Spanning Tree is the tree that connects every vertex in the graph, such that the sum of the weights of the edges is minimal.

Personal tools