In Faster Min Cut, first contraction is used to form two
subgraphs that has
vertices. Then recursively, min-cuts of these two subgraphs
Finally, the smaller of the min cuts of these subgraphs is chosen as the final min cut value.
This algorithm can be viewed as binary computation tree. In faster min cut, the depth of tree is
and in the earlier version it is 1. If we had more time, we would also implement this version
of randomized min cut that runs in O(logn) time and uses O() space.