中文摘要：

最大流问题在工程计算机原理与通信系统、应用数学以及社会和军事等领域有着广泛的应用.利用最短增广路算法可以有效改进最大流问题的运行时间,提高计算效率.本文是对最短增广路算法改进最大流问题运行时间证明过程的部分修正.

英文摘要：

The maximum flow problem in computer theory and communications systems engineering,applied mathematics,and social and military fields has been widely used.Use the shortest augmenting path algorithm can effectively improve the running time of maximum flow problems.This is the shortest augmenting path algorithm for the maximum flow problem to improve the running time of that part of the revision process.