Revision as of 12:44, 4 February 2010 edit 129.132.153.228 (talk) Path vs. walk ← Previous edit		Revision as of 12:45, 4 February 2010 edit undo SineBot (talk \| contribs) Bots 2,564,856 edits m Signing comment by 129.132.153.228 - "Path vs. walk" Next edit →
Line 80: == Path vs. Walk == 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-->

Talk:Bellman–Ford algorithm: Difference between revisions