Content deleted Content added
Nils Grimsmo (talk | contribs) Re: |
Cronholm144 (talk | contribs) m Rate articles, occasionally unicodify, comment, etc... using AWB |
||
Line 1:
{{maths rating
|nested=
|small=
|class=start
|importance=low
|field=applied
|historical=
}}
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)
| |||