| 点和边有容量约束的网络最大流新算法 |
| |
| 引用本文： | 厍向阳,罗晓霞.点和边有容量约束的网络最大流新算法[J].计算机应用,2008,28(1):143-145. |
| |
| 作者姓名： | 厍向阳 罗晓霞 |
| |
| 作者单位： | 西安科技大学 |
| |
| 摘 要： | 针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。定义了有向路径和残量网络的概念，依据可行流分解定理，引入人工智能中搜索的方法，以邻接矩阵为网络数据存储结构，提出条件约束下的网络最大流新算法。最后，通过实例进行了算法测试和比较。算法测试表明：点和边有容量约束的网络最大流新算法是完全可行和有效的。
|
| 关 键 词： | 邻接矩阵 网络最大流 可行流 容量约束 残量网络 |
| 文章编号： | 1001-9081(2008)01-0143-03 |
| 收稿时间： | 2007-07-19 |
| 修稿时间： | 2007年7月19日 |
New algorithm for maximum flow algorithm in network with both node and edge capacity confined |
| |
| SHE Xiang-yang,LUO Xiao-xia.New algorithm for maximum flow algorithm in network with both node and edge capacity confined[J].journal of Computer Applications,2008,28(1):143-145. |
| |
| Authors: | SHE Xiang-yang LUO Xiao-xia |
| |
| Affiliation: | SHE Xiang-yang,LUO Xiao-xia(Department of Computer Science , Technology,Xi'an University of Science , Technology,Xi'an Shaanxi 710054,China) |
| |
| Abstract: | Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied. The orientation path and residual network were defined, the new maximum flow algorithm in network with both node and edge capacity confined was put forward based on feasible flow decompose theorem and by way of the search in artificial intelligence. In the end, the algorithm was validated and compared by examples. Algorithm testing shows: The new maximum flow algorithm in network with both node and edge capacity confined is completely feasible and availability effective. |
| |
| Keywords: | adjacency matrix maximum flow in network feasible flow confined capacity residual network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
