Randomized Contraction Algorithm for The Minimum Cut Problem

In this project I coded up the randomized contraction algorithm and used it to compute the min cut (the minimum possible number of crossing edges) of an undirected graph.

The java codes I wrote are in the src folder.