Revision as of 13:42, 31 May 2005 edit Zero0000 (talk \| contribs) Autopatrolled, Extended confirmed users, Administrators 43,858 edits no, it is correct ← Previous edit		Revision as of 14:09, 31 May 2005 edit undo Kristjan Wager (talk \| contribs) 417 edits No edit summary Next edit →
Line 3: : The article is precisely correct! Please don't change it without discussion. --[[User:Zero0000\|Zero]] 13:42, 31 May 2005 (UTC) ::According to Cormen et al's ''Introduction to Algorithms, 2nd edition'', the breadth-first search is done to reduce the search time from <math>O(E\|f^*\|)</math> to <math>O(VE^2)</math> (see pages 658-663). It has nothing as do with ensuring that the algorithm terminates - this is ensured by the principles of the Ford-Fulkerson method.--[[User:Kristjan Wager\|Kristjan Wager]] 14:09, 31 May 2005 (UTC)

Talk:Edmonds–Karp algorithm: Difference between revisions