Revision as of 09:52, 31 May 2005 edit Kristjan Wager (talk \| contribs) 417 edits No edit summary		Revision as of 13:42, 31 May 2005 edit undo Zero0000 (talk \| contribs) Autopatrolled, Extended confirmed users, Administrators 43,857 edits no, it is correct Next edit →
Line 1: In the article, it is stated that "The distinguishing feature is that the shortest augmenting path is used at each step, which guarantees that the computation will terminate." However, as I understand it, the use of the shortest augmenting path ensure a faster running time than using breadth-running time. The terminiation of the computation is also ensured in the other algorithms based on Ford-Fulkerson, and has as such nothing to do with the breadth-first search. I will try to work on this entry at a later stage.--[[User:Kristjan Wager\|Kristjan Wager]] 09:52, 31 May 2005 (UTC) : The article is precisely correct! Please don't change it without discussion. --[[User:Zero0000\|Zero]] 13:42, 31 May 2005 (UTC)

Talk:Edmonds–Karp algorithm: Difference between revisions