Revision as of 00:24, 8 April 2009 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →Implementation removed: new section ← Previous edit		Revision as of 16:31, 7 May 2009 edit undo 68.43.177.99 (talk) →Dijkstra is not greedy Next edit →
Line 59: Bellmam ford algorithm can be used in the network having negative terms in the nodes.I <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/59.98.124.227\|59.98.124.227]] ([[User talk:59.98.124.227\|talk]]) 06:38, 24 March 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> The [[greedoid]] page that you linked to explicitly lists Dijkstra's algorithm as an example. So, uh, yeah. == Implementation removed ==

Talk:Bellman–Ford algorithm: Difference between revisions