Ahuja

Ahuja, R.K. and Orlin, J.B. and Tarjan, R.E. Method 10 had developed a version of the Ahuja-Orlin algorithm 9 that uses of wave scaling, tree scaling a , dynamic tree data structure. Latterly, Chintan. Jain and D. Garg 11 planned a Modified Edmonds-Karp algorithm to solve the maximum flow problem, which requires less number of iterations and fewer augmentations to calculate the maximum flow. Also Kalyan Kumar Mollick 14 planned a version of Modification of Edmonds-Karp Algorithm to solve the maximum flow problem which was same as Chintan Jain and D. Garg 11 algorithm. This algorithm was generous a very quick manner to get result than Chintan Jain and D. Garg 11 algorithm. In writing, a great number of researchers 12, 13 are accessible for tackling such sort of problems. They had also formulated the maximal-flow problem as a linear programming problem (LPP) and solved it by using Bounded Variable Simplex Method.