Algorithm - Stoer-Wagner

Initialize graph $G$ with all vertices and edges. Min_cut = infinity While $|V| > 1$: Run maximum adjacency ordering on $G$ to get vertex sequence. Let $s$ = second-to-last vertex, $t$ = last vertex. Cut_value = sum of edge weights from $t$ to all other vertices. Min_cut = min(min_cut, cut_value).

Merge $s$ and $t$ in $G$ (combine their edges into a supernode). Output min_cut. Each iteration considers one cut and contracts the graph.