# Edmonds–Karp algorithm

In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in ${\displaystyle O(|V||E|^{2})}$ time. The algorithm was first published by Yefim Dinitz in 1970,[1][2] and independently published by Jack Edmonds and Richard Karp in 1972.[3] Dinitz's algorithm includes additional techniques that reduce the running time to ${\displaystyle O(|V|^{2}|E|)}$.[2]

## Algorithm

The algorithm is identical to the Ford–Fulkerson algorithm, except that the search order when finding the augmenting path is defined. The path found must be a shortest path that has available capacity. This can be found by a breadth-first search, where we apply a weight of 1 to each edge. The running time of ${\displaystyle O(|V||E|^{2})}$ is found by showing that each augmenting path can be found in ${\displaystyle O(|E|)}$ time, that every time at least one of the ${\displaystyle E}$ edges becomes saturated (an edge which has the maximum 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 ${\displaystyle |V|}$. Another property of this algorithm is that the length of the shortest augmenting path increases monotonically. There is an accessible proof in Introduction to Algorithms.[4]

## Pseudocode

algorithm EdmondsKarp is
input:
graph   (graph[v] should be the list of edges coming out of vertex v in the
original graph and their corresponding constructed reverse edges
which are used for push-back flow.
Each edge should have a capacity 'cap', flow, source 's' and sink 't'
as parameters, as well as a pointer to the reverse edge 'rev'.)
s       (Source vertex)
t       (Sink vertex)
output:
flow    (Value of maximum flow)

flow := 0   (Initialize flow to zero)
repeat
(Run a breadth-first search (bfs) to find the shortest s-t path.
We use 'pred' to store the edge taken to get to each vertex,
so we can recover the path afterwards)
q := queue()
q.push(s)
pred := array(graph.length)
while not empty(q) and pred[t] = null
cur := q.pop()
for Edge e in graph[cur] do
if pred[e.t] = null and e.t ≠ s and e.cap > e.flow then
pred[e.t] := e
q.push(e.t)

if not (pred[t] = null) then
(We found an augmenting path.
See how much flow we can send)
df := ∞
for (e := pred[t]; e ≠ null; e := pred[e.s]) do
df := min(df, e.cap - e.flow)
(And update edges by that amount)
for (e := pred[t]; e ≠ null; e := pred[e.s]) do
e.flow  := e.flow + df
e.rev.flow := e.rev.flow - df
flow := flow + df

until pred[t] = null  (i.e., until no augmenting path was found)
return flow


## Example

Given a network of seven nodes, source A, sink G, and capacities as shown below:

In the pairs ${\displaystyle f/c}$ written on the edges, ${\displaystyle f}$ is the current flow, and ${\displaystyle c}$ is the capacity. The residual capacity from ${\displaystyle u}$ to ${\displaystyle v}$ is ${\displaystyle c_{f}(u,v)=c(u,v)-f(u,v)}$, the total capacity, minus the flow that is already used. If the net flow from ${\displaystyle u}$ to ${\displaystyle v}$ is negative, it contributes to the residual capacity.

Path Capacity Resulting network
${\displaystyle A,D,E,G}$ {\displaystyle {\begin{aligned}&\min(c_{f}(A,D),c_{f}(D,E),c_{f}(E,G))\\=&\min(3-0,2-0,1-0)\\=&\min(3,2,1)=1\end{aligned}}}
${\displaystyle A,D,F,G}$ {\displaystyle {\begin{aligned}&\min(c_{f}(A,D),c_{f}(D,F),c_{f}(F,G))\\=&\min(3-1,6-0,9-0)\\=&\min(2,6,9)=2\end{aligned}}}
${\displaystyle A,B,C,D,F,G}$ {\displaystyle {\begin{aligned}&\min(c_{f}(A,B),c_{f}(B,C),c_{f}(C,D),c_{f}(D,F),c_{f}(F,G))\\=&\min(3-0,4-0,1-0,6-2,9-2)\\=&\min(3,4,1,4,7)=1\end{aligned}}}
${\displaystyle A,B,C,E,D,F,G}$ {\displaystyle {\begin{aligned}&\min(c_{f}(A,B),c_{f}(B,C),c_{f}(C,E),c_{f}(E,D),c_{f}(D,F),c_{f}(F,G))\\=&\min(3-1,4-1,2-0,0-(-1),6-3,9-3)\\=&\min(2,3,2,1,3,6)=1\end{aligned}}}

Notice how the length of the augmenting path found by the algorithm (in red) never decreases. The paths found are the shortest possible. The flow found is equal to the capacity across the minimum cut in the graph separating the source and the sink. There is only one minimal cut in this graph, partitioning the nodes into the sets ${\displaystyle \{A,B,C,E\}}$ and ${\displaystyle \{D,F,G\}}$, with the capacity

${\displaystyle c(A,D)+c(C,D)+c(E,G)=3+1+1=5.\ }$

## Notes

1. ^ Dinic, E. A. (1970). "Algorithm for solution of a problem of maximum flow in a network with power estimation". Soviet Mathematics - Doklady. 11. Doklady: 1277–1280.
2. ^ a b Yefim Dinitz (2006). "Dinitz' Algorithm: The Original Version and Even's Version" (PDF). In Oded Goldreich; Arnold L. Rosenberg; Alan L. Selman (eds.). Theoretical Computer Science: Essays in Memory of Shimon Even. Springer. pp. 218–240. ISBN 978-3-540-32880-3.
3. ^ Edmonds, Jack; Karp, Richard M. (1972). "Theoretical improvements in algorithmic efficiency for network flow problems" (PDF). Journal of the ACM. 19 (2): 248–264. doi:10.1145/321694.321699. S2CID 6375478.
4. ^ Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein (2009). "26.2". Introduction to Algorithms (third ed.). MIT Press. pp. 727–730. ISBN 978-0-262-03384-8.{{cite book}}: CS1 maint: multiple names: authors list (link)

## References

1. Algorithms and Complexity (see pages 63–69). https://web.archive.org/web/20061005083406/http://www.cis.upenn.edu/~wilf/AlgComp3.html