fast graph-cuts for grids

High performance
min-cut solver for grids

GridCut is fast multi-core max-flow/min-cut solver optimized for grid-like graphs. It brings superior performance to applications ranging from image and video processing to computer vision and medical imaging. It is lightweight, easy to integrate, comes with full source code in C++, and compiles on all major platforms.


GridCut consistently outperforms state-of-the-art max-flow/min-cut solvers on wide range of benchmarking instances from real world applications.

Multi-core support

GridCut takes advantage of multi-core CPUs by splitting the work between multiple threads and performing the computation in parallel.

Low memory usage

GridCut is ideal for mobile devices or other resource-limited environments as it can solve larger problems without running out of memory.