 Karger's basic algorithm iteratively contracts randomly chosen edges until only two nodes remain; those nodes represent a cut in the original graph.By iterating this basic algorithm a sufficient number of times, a minimum cut can be found with high probability.A "cut" formula_7 in an undirected graph formula_2 is a partition of the vertices formula_9 into two non-empty, disjoint sets formula_10.