Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network in much more optimized approach. Edmonds-Karp is identical to Ford-Fulkerson except for one very important trait that is the search order of augmenting paths is well defined. This paper presents some modifications of Edmonds-Karp algorithm for solving maximum flow problem (MFP). Solution of MFP has also been illustrated by using the proposed algorithm to discuss the functionality of proposed method.
Show abstract
Full Text
