next up previous
Next: Prim's Algorithm Up: CSE 2320: Algorithms and Previous: Theorem 24.1

Corollary 24.2

Given A $\subseteq$ MST(G) and a connected component C of the forest GA(V, A), if (u,v) is a light edge connecting C to some other component in GA, then (u,v) is safe for A.

Algorithm:
1. Find two unconnected components of G.
2. Connect them using a light edge.



Copyright © 1998 The University of Texas at Arlington