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


A (S, V-S) of an undirected graph G = (V, E) is a partition of V.


An edge (u,v) $\in$ E the cut (S, V-S) if u $\in$ S and v $\in$ V-S.


(a,b) and (b,d) cross the cut

Copyright © 1998 The University of Texas at Arlington