An improved algorithm for maximum flow problem

This article covers a problem that often arises in real life situations - the maximum flow problem. Ford-Fulkerson algorithm is very old, but very simple. The stochastic characteristic to choose the augmenting path may lead to too much iterative times. We present an improved algorithm in flow network area. Numerical experiments prove that the new algorithm is more effectiveness than the Ford-Fulkerson algorithm in some cases.