MinCut

Compute the minimum cut of a connected graph using Karger's algorithm.

Sample client

Client options:

$ ./client.py -h

Compute the minimum cut for the graph represented as an adjacency list, running the default number of iterations:

$ ./client.py graph.txt

3

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
.gitignore		.gitignore
.travis.yml		.travis.yml
README.md		README.md
client.py		client.py
graph.py		graph.py
graph.txt		graph.txt
mincut.py		mincut.py
test_graph.py		test_graph.py
test_mincut.py		test_mincut.py