SolveKarger uses probabilistic Karger algorithm of finding minimal global cut.

Recursive optimization of Karger algorithm: it doubles execution tree after contraction to n/sqrt(2), n/2, n/(2sqrt(2)), n/4, et cetera.

For some reason it's 5 times slower than Edmonds-Karp if check all sink nodes t.

Same as FFA, but BFS instead of DFS was used.

SolvePart1FFA solves part 1 using Ford-Fulkerson Algorithm / method (FFA).

Stoer-Wagner algorithm: O(V) phases, each O(E log V) by using binary heap queue.