计算机技术与发展2011，Vol.21Issue(12)：113-115,3.
求解网络最大流问题的标号算法
Labeling Algorithm to Solve Maximum Network Flow Problem
摘要
Abstract
It provides a new way-labeling algorithm to solve network flow. Every vertex is labeled and vertex has the same number in arc as grades. Choose the way that has a grade. After every way that has only a grade,choose the way that has bigger arc capacity and shorter path. The algorithm is easy to understand and avoids the shortcomings of several labeling and adjusting process through improving Ford-Fulkerson labeling algorithm. The algorithm improves efficiency to solve the maximum network flow. The algorithm gives specific steps and manifests the practices of the algorithm through example.关键词
最大流/Ford-Fulkerson标号算法/增广链/标号Key words
maximum network flow/Ford-Fulkerson labeling algorithm/augmented chain/labeling分类
信息技术与安全科学引用本文复制引用
赵礼峰,白睿,宋常城..求解网络最大流问题的标号算法[J].计算机技术与发展,2011,21(12):113-115,3.基金项目
国家自然科学基金(61070234,61071167) （61070234,61071167）
