<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
the	O
Edmonds	B-Algorithm
–	I-Algorithm
Karp	I-Algorithm
algorithm	I-Algorithm
is	O
an	O
implementation	O
of	O
the	O
Ford	B-Algorithm
–	I-Algorithm
Fulkerson	I-Algorithm
method	I-Algorithm
for	O
computing	O
the	O
maximum	B-Algorithm
flow	I-Algorithm
in	O
a	O
flow	B-Algorithm
network	I-Algorithm
in	O
time	O
.	O
</s>
<s>
Dinic	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
includes	O
additional	O
techniques	O
that	O
reduce	O
the	O
running	O
time	O
to	O
.	O
</s>
<s>
The	O
algorithm	O
is	O
identical	O
to	O
the	O
Ford	B-Algorithm
–	I-Algorithm
Fulkerson	I-Algorithm
algorithm	I-Algorithm
,	O
except	O
that	O
the	O
search	O
order	O
when	O
finding	O
the	O
augmenting	O
path	O
is	O
defined	O
.	O
</s>
<s>
This	O
can	O
be	O
found	O
by	O
a	O
breadth-first	B-Algorithm
search	I-Algorithm
,	O
where	O
we	O
apply	O
a	O
weight	O
of	O
1	O
to	O
each	O
edge	O
.	O
</s>
<s>
(	O
Run	O
a	O
breadth-first	B-Algorithm
search	I-Algorithm
(	O
bfs	O
)	O
to	O
find	O
the	O
shortest	O
s-t	O
path	O
.	O
</s>
<s>
The	O
flow	O
found	O
is	O
equal	O
to	O
the	O
capacity	O
across	O
the	O
minimum	B-Algorithm
cut	I-Algorithm
in	O
the	O
graph	O
separating	O
the	O
source	O
and	O
the	O
sink	O
.	O
</s>
