Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (19): 78-81.

• 网络、通信、安全 • Previous Articles     Next Articles

Research on network maximum flows algorithm of cascade level graph

PAN Hexin1,YI Chongxin2,LI Man2   

  1. 1.Dept. of Informaition Technology,Changzhou Textile Garment Institute,Changzhou,Jiangsu 213164,China
    2.Dept. of Computer,Shandong Huayu Vocational College,Dezhou,Shandong 253034,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-07-01 Published:2011-07-01

级连层次图的网络最大流算法研究

潘荷新1,伊崇信2,李 满2   

  1. 1.常州纺织服装职业技术学院 信息技术系,江苏 常州 213164
    2.山东华宇职业技术学院 计算机系,山东 德州 253034

Abstract: This paper gives an algoritm that structures a network cascade level graph to find out maximum flow of the network indirectly.For the given network N=(G,s,t,C) that has n vetexes and e arcs,this algorithm finds out the maximum value of the network flow fast in O(n2) time that flows from the network N and the network flows when the value of the one reach maximum.

Key words: network, cascade level graph, maximum flow

摘要: 给出一种通过构造网络级连层次图的方法,来间接求出最大网络流的算法。对于给定的有n个顶点,e条边的网络N=G,s,t,C,该算法可在On2时间内快速求出流经网络N的最大网络流及达最大流时的网络流。

关键词: 网络, 级连层次图, 最大流