Content deleted Content added
m Signing comment by 129.132.153.228 - "Path vs. walk" |
No edit summary |
||
Line 81:
The article consistently mentions ''path'' (which, by definition, is required to not duplicate any vertex) when it means ''walk'' (any sequence of adjacent edges, repeating vertices are possible). This should be imho fixed... In fact, Bellman-Ford algorithm finds shortest walks of length at most n. Requiring shortest ''paths'' is what makes the problem hard. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/129.132.153.228|129.132.153.228]] ([[User talk:129.132.153.228|talk]]) 12:44, 4 February 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Unclarity ==
Introduction says: "Bellman-Ford cannot find the shortest path that does not repeat any vertex in such a graph". I can't understand this sentence at all. Did someone want to say that B-F cannot find the negative cycle, it is only able to detect it?
| |||