A Simple Solution to Maximum Flow at Minimum Cost

This paper presents a simple approach to work out maximum flows at minimum cost. The algorithm, on which the algorithm depends, is verified strictly. The algorithm can obtain a lot of adjusting paths in every iteration. An example is given to demonstrate the use of the algorithm. The algorithm has the merits to be programmed easily and of good convergence, and many experiments have verified its great practicability and effectiveness. It can help teaching improvement and practice application. It is also worth popularization.