next up previous
Next: Theorem 24.1 Up: CSE 2320: Algorithms and Previous: Definitions:


A cut the set A of edges if no edge in A crosses the cut.


A = (V, E), V = {a, b, c, d}, E = {(a,b), (b,c)}

An edge is a crossing a cut if its weight is the minimum of any edge crossing the cut.


(b,d) is the light edge

Copyright © 1998 The University of Texas at Arlington