Contraction Algorithm
	l Repeat  n - 2  times: » find non-min-cut edge » contract it (keep parallel edges) l Each contraction decrements #vertices l At end, 2 vertices left » unique cut » corresponds to min-cut of starting graph