Karger’s Algorithm is a Randomised Algorithm used to Find the Minimum Cut (Min-Cut) of a Connected, Undirected Graph. It is Celebrated for its Simplicity and for Being a Classic example of a "Monte Carlo" Algorithm—One that is Fast and Usually Correct, but has a Small Chance of Failing