A cut (S, V − S) of an undirected graph G = (V,E) is a partition of V . An edge (u, v) ∈ E crosses the cut iff one of its endpoints is in S and the other is in V −S.
An edge is a light edge crossing a cut if its weight is the minimum of any edge crossing the cut. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
