next up previous
Next: Growing a Minimal Spanning Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Minimum Spanning Trees

Given a connected, undirected graph G = (V, E) with edge weights w(u,v) for each edge (u,v) $\in$ E,
the (MST) T = (V, E') of G,
\(E' \;\subseteq\; E\), is an acyclic, connected graph such that w(t) = \(\sum_{(u,v) \in E'} w(u,v)\) is minimized.




Circuit wiring: connecting common pins with minimal wire

Minimum Spanning Tree

Copyright © 1998 The University of Texas at Arlington