dukn / Karger-Min-Cut

Finding minimum cut of a undirected (directed with few alteration) graph.

#Karger Min Cut Algorithm

Karger algorithm is one of the technique to find minimum cut of a undirected graph (with few alteration for directed graph).

##How to use

1. Alter kargerMinCut.txt file to input graph nodes.

##Coded by Reet Awwsum

NOTE: Using adjacent list for storing the nodes of a graph. Coded in PYTHON