Karger’s algorithm to find Minimum Cut

In this article, we will explore how the Karger's algorithm works to find the minimum cut in a graph and its C implementation. This is a randomized algorithm based on Graphs.

Table of contents:

What is the minimum cut?Karger's AlgorithmSuccess Probability and Time complexityCode Implementation of Karger's algorithm

Pre-requisite: Randomized algorithm, Minimum Cut

Let us get started with Karger’s algorithm to find Minimum Cut.

What is the minimum cut?

The minimum cut in a graph refers to t...