Karger's Randomized Min-Cut Algorithm (2D)

This 2D companion runs the identical real Karger contraction algorithm as the 3D version — the same fixed graph (two near-complete 4-vertex clusters joined by exactly 2 bridging edges, true min cut = 2), the same uniformly-random edge pick, merge and self-loop discard — but drawn as a flat node-link diagram instead of an orbiting 3D scene, so the shrinking graph and its final candidate cut are easier to read at a glance.