A flat node-link view of the same real Karger contraction algorithm as the 3D version: random edges are repeatedly contracted, merging vertices into super-vertices until only two remain, and the remaining parallel edges form a candidate cut. Repeated trials track the smallest cut found so far.