Abstract:
The implementation version of Ford Fulkerson algorithm is known as Edmonds-Karp algorithm. The concept of Edmonds-Karp is to use BFS (Breadth First Search) in Ford Fulkerson execution as BFS always choices a path with least. This study likewise is a change form of Edmonds-Karp algorithm. In this study, we need to present an alternate approach for finding the maximum flow concerning less number of iterations and augmentation than Edmonds-Karp algorithm. A numerical illustration is appeared for showing the proposed algorithm to finding the maximal-flow problem by a Breadth First Search (BFS) method.
