用木桶原理改进最大流算法

The improvement of maximum flow algorithm based on Barrel Principle

传统求网络最大流算法需要反复将网络图进行标号和增流,存在步骤繁复、计算量大的问题。本文提出了一种寻找最大流的改进标号法。此方法通过寻找网络中可能的最小割进行标号、分配流量,可以简化计算过程,提高运算效率。

The traditional algorithm for maximum flow in network needs repeatedly labeling and flow-increasing for network diagrams,showing problems of complicated steps and large computation.This paper presents an improved labeling method for searching maximum flow,which labels and distributes flow by finding the possible minimum cut,it can simplify the calculation process and improve operational efficiency.