| 用木桶原理改进最大流算法 |
| |
| 引用本文： | 李苑辉.用木桶原理改进最大流算法[J].长春大学学报,2011(6):47-49. |
| |
| 作者姓名： | 李苑辉 |
| |
| 作者单位： | 三亚航空旅游职业学院数学教研室; |
| |
| 摘 要： | 传统求网络最大流算法需要反复将网络图进行标号和增流,存在步骤繁复、计算量大的问题。本文提出了一种寻找最大流的改进标号法。此方法通过寻找网络中可能的最小割进行标号、分配流量,可以简化计算过程,提高运算效率。
|
| 关 键 词： | 最大流问题 Ford-FuIkerson标号法 木桶原理 最小割 |
The improvement of maximum flow algorithm based on Barrel Principle |
| |
| LI Yuan-hui.The improvement of maximum flow algorithm based on Barrel Principle[J].Journal of Changchun University,2011(6):47-49. |
| |
| Authors: | LI Yuan-hui |
| |
| Institution: | LI Yuan-hui(Mathematics Department,Sanya Aviation and Tourism College,Sanya 572000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | maximum flow problem Ford-FuIkerson Labeling Method Barrel Principle minimum cut |
| 本文献已被 CNKI 维普 等数据库收录！ |
