Revision as of 04:01, 3 June 2003 edit Poor Yorick (talk \| contribs) 5,271 edits No edit summary		Revision as of 19:52, 8 August 2003 edit undo Nixdorf (talk \| contribs) Extended confirmed users 7,383 edits m link Next edit →
Line 1: In [[computer science]], in the field of [[graph theory]], the '''Edmonds-Karp algorithm''' is an implementation of the ''[[Ford-Fulkerson algorithm]]'' except that the computation of the shortest augmenting path is a [[breadth-first search]]. The Edmonds-Karp algorithm [[Big O notation\|runs]] in O(VE<sup>2</sup>) time, where V and E is the number of vertices and edges in a [[graph]], respectively.

Edmonds–Karp algorithm: Difference between revisions