Planar Cut Source Code
The PlanarCut library computes max-flow/min-s-t-cut on planar graphs. It implements an efficient algorithm, which has almost linear running time. The library also provides for several easy-to-use interfaces in order to define planar graphs that are common in computer vision applications (see CVPR 2009). The code was implemented by Eno Töppe and Frank R. Schmidt – Download Source Code: planatcut-v1.0.2.zip - September 22, 2011 (LGPL)