Graph
Algorithm
Statistics
8
Nodes Left
0
Edges
-
Cut Size
∞
Best Found
Trial History
About
Karger's algorithm randomly contracts edges until only 2 nodes remain. The edges between them form a cut. Running O(n²log n) trials gives high probability of finding the minimum cut.