Ford-Fulkerson方法还比较好理解
即每一次尝试都需要在剩余图里找到一条增强路径。让整个图的流量最大化。
Algorithm Operation(s) | Residual Graph |
---|---|
Initialize the residual graph by setting the preflow to values 0 and initializing the labeling. | ![]() |
Initial saturating push is performed across all preflow edges out of the source, s. | ![]() |