Revision as of 10:31, 20 July 2004 edit Sesse (talk \| contribs) 177 edits m Revert previous change :-) ← Previous edit		Revision as of 19:34, 25 October 2004 edit undo Chopchopwhitey (talk \| contribs) 518 edits m Category:Graph algorithms Next edit →
Line 2: 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 theory\|graph]], respectively. [[Category:Graph algorithms]]

Edmonds–Karp algorithm: Difference between revisions