Research on the Maximum Flow Problem with Multiple Solutions

his paper introduces multiple solutions to maximum flow and presents a simple approach to work out some special maximum flows. The result by the algorithm has double meanings: that is to say, the maximum flow not only has saturated edges as many as possible, but also has edges as small as possible, namely more zero-flow edges. As a result, it can optimize execute efficiency of algorithm to the utmost. It is also worth popularization.