graphcut / max-flow
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(mn2C), however it also makes use of the properties of the two dimensional array graph for improving the constant factor.
graphcut-0.3.tar.gz