www.quiss.org

operated by Matthias Kramm since 2001

A C implementation of a max-flow algorithm, optimized for two-dimensional arrays
(like images). The code uses the tree searching algorithm introduced in the paper
by Boykov and Kolmogorov and hence is of worst-case complexity O(mn^{2}C), however it also makes use of the properties of the
two dimensional array graph for improving the constant factor.