Content deleted Content added
No edit summary |
m Signing comment by 78.157.76.143 - "" |
||
Line 85:
== 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? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/78.157.76.143|78.157.76.143]] ([[User talk:78.157.76.143|talk]]) 05:41, 21 April 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
| |||