中文说明：Maxflow v3.01 库计算最大流/min-割上任意图形。它实现了 Boykov-柯尔莫哥洛夫算法，这往往会是快速的计算机视觉问题。B-K 算法及第一次实现了时，撰文人在西门子公司的研究，但我们不能将分发的原始版本。这里的代码是独立重新实施由 Vladimir 柯尔莫哥洛夫基于已发布的材料。
English Description：
The maxflow-v3.01 library computes max-flow/min-cut on arbitrary graphs. It implements the Boykov-Kolmogorov algorithm, which tends to be is fast for computer vision problems. The B-K algorithm and its first implementation were developed while the authors were at Siemens Corporate Research, but we cannot distribute the original version. The code here was independently re-implemented by Vladimir Kolmogorov based on published materials.