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.