Quiz: Stoer-Wagner Algorithm

Stoer-Wagner finds the global minimum cut of an undirected weighted graph without a fixed source or sink. How many phases does it run?

1. A.$n$ phases, contracting one node per phase
2. B.$n - 1$ phases, producing one candidate cut per phase
3. C.$m$ phases, examining one edge per phase
4. D.$\log n$ phases using divide and conquer