This repository implements the Karger's Algorithm to find the minimum cut for a given graph.
-
Updated
Nov 26, 2023 - C++
This repository implements the Karger's Algorithm to find the minimum cut for a given graph.
Add a description, image, and links to the naive-karger-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the naive-karger-algorithm topic, visit your repo's landing page and select "manage topics."