Create randomContraction.py

Stanford Algorithms Course Part I. Week 3
Random Contraction algorithm to compute the minimum cut of graphs. 
The minimum cut refers to the minimum number of edges that crosses all possible (bifurcated) partions of a graph.