Implementation of Karger's randomized solution to find the minimum cut
of a graph. Number of nodes and path to input adjacency array are hard
coded at the top of teh file.