Description: An implementation of "A min cut algorithm" by Stoer and Wagner.
In addition there is an option to find the minimal cut that does not separate a set of vertices.
This is not a mincut-maxflow algorithm.
To Search:
File list (Check if you may need any files):
license.txt
mincut.m
Download