An improved algorithm for solving maximum flow problem

There are lots of steps and complicated calculation in the existing algorithm for solving the maximum flow,and because of improper selection order of augmented path, we cannot obtain the ideal maximum flow. In order to solve these problems in existing algorithm, this paper make some improvement of the existing algorithms, then puts forward a new improved algorithm for solving the maximum flow problem which make use of divide area and the degree of vertex. And it is verified that the improved algorithm is effective and intuitive through the concrete example, and avoid the labeling process, the entire operation process only needs drawing a diagram to be completed.