# edmonds karp multiple source and sink Algorithm

In computer science, the Edmonds – Karp algorithm is an implementation of the Ford – Fulkerson method for compute the maximal flow in a flow network. The algorithm was first published by Yefim Dinitz in 1970.

### edmonds karp multiple source and sink source code, pseudocode and analysis

The algorithm is identical to the Ford – Fulkerson algorithm, except that the search order when finding the augmenting path is defined.O(|E|) time, that every time at least one of the edges becomes saturated (an edge which has the maximal possible flow), that the distance from the saturated edge to the source along the augmenting path must be longer than last time it was saturated, and that the length is at most.