A cut is something that separates a graph into two
pieces. Two equivalent ways of defining a cut:
- Two sets of nodes that partition V.
- The set of edges that go between two sets of nodes that partition
V.
Example...
Next: Greedy-Grow Lemma
Up: FINDING MINIMUM SPANNING TREES
Previous: Greedy Approach