| 基于标号法求解网络最大流算法的研究 |
| |
| 引用本文： | 孙泽宇.基于标号法求解网络最大流算法的研究[J].甘肃联合大学学报(自然科学版),2009,23(4):64-66. |
| |
| 作者姓名： | 孙泽宇 |
| |
| 作者单位： | 洛阳理工学院,计算机与信息工程系,河南,洛阳,471023 |
| |
| 摘 要： | 近年来,随着各种网络的飞速发展,对最大流问题的研究也取得了很大的进展.本文简述了网络最大流问题的现状,提出了一种求解网络最大流与最小截问题的算法.此算法使得计算网络最大流变得简便,且具有很强的实用性.
|
| 关 键 词： | 网络最大流 算法 最大流问题 最小截 |
Research in the Algorithm on the Solution to the Maximum Network Flow Problem Base on Mark |
| |
| SUN Ze-yu.Research in the Algorithm on the Solution to the Maximum Network Flow Problem Base on Mark[J].Journal of Gansu Lianhe University :Natural Sciences,2009,23(4):64-66. |
| |
| Authors: | SUN Ze-yu |
| |
| Institution: | Computer and Information Engineering Department Luoyang Institute of Science and Technology;Luoyang 471023;China |
| |
| Abstract: | Various networks has got rapid development recently,the research on the maximum flow problem has made remarkable achievements.In this article,the condition of the maximum flow problem is proposed and presents a algorithm for the solution to the maximum flow problem and minimum cut.The way of the algorithm in the paper is not only simpler but is also more practicality than the other algorithm's. |
| |
| Keywords: | The maximum flows Algorithm Maximum flow problem The minimum cut |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
