SCIP
Solving Constraint Integer Programs
•All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Graph minimum cut routine
The implemented algorithm is described in "A Faster Algorithm for Finding the Minimum Cut in a Graph" by Hao and Orlin.
A list of all interface methods can be found in grph.h.