中文说明：学习这个算法是为学习图像处理中的图割算法做准备的。 基本概念： 1.最大流是一个有向图。 2.一个流是最大流，当且仅当它的残余网络中不包括增广路径。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报
English Description：
This algorithm is preparing for graph cuts algorithm in image processing. Basic concepts: 1. the maximum flow is a directed graph. 2. the maximum flow in a flow is, if and only if it does not include augmenting path in the residual network. 3. the minimum cut is to network all the cuts in the minimum value of the cut, minimum cut is not unique, but the minimum cut value is unique. 4. the maximum flow is equal to the capacity of a minimum cut. Algorithm is the Ford-Fulkerson method.