Notice of RetractionA simple solution to maximum flow of zero-flow edges

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The algorithm of maximum flow with more solve ways has been introduced. It can adjust maximum flow and feasible flow. The algorithm has double meanings: first, 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. The algorithm uses depth-first search (DFS) to search, remove the improper vertex pairs, making the flowing path which can be adjusted to the least. It optimizes execute efficiency of algorithm to the utmost. The best nature is to understand and hold the algorithm easily. It can help teaching improvement and practice application. It is also worth popularization.