MIT
13
Contraction Algorithm
lRepeat n - 2 times:
»find
non-min-cut edge
»contract
it (keep parallel edges)
lEach
contraction decrements #vertices
lAt
end, 2 vertices left
»unique
cut
»corresponds
to min-cut of starting graph