Karger's randomized contraction algorithm finding global minimum cuts in multigraph networks via recursive random edge collapses in pure Python.
-
Updated
Sep 9, 2026 - Python
Karger's randomized contraction algorithm finding global minimum cuts in multigraph networks via recursive random edge collapses in pure Python.
Karger's randomized contraction algorithm finding global minimum cuts in multigraph networks via recursive random edge collapses in pure Python.
randomized Karger's algorithm for min-cut
This repository implements the Karger's Algorithm to find the minimum cut for a given graph.
To associate your repository with the karger-algorithm topic, visit your repo's landing page and select "manage topics."