Talk:Bellman–Ford algorithm: Difference between revisions

Revision as of 01:04, 11 September 2007

Revision as of 13:02, 17 January 2009

Line 1:

== Assembly code==

Assembly code has no place in algorithm articles; it doesn't help explain the algorithm at all.

Line 38 ⟶ 39:

: http://xkcd.com/69/

--[[User:JakeVortex|Jake]] 01:04, 11 September 2007 (UTC)

== A doubt ==

Are we sure this is the Bellman-Ford algorithm and not the generic labeling method? There's a source in which Bellman-Ford is described as an optimization of the labeling algorithm using a FIFO queue. <ref>[avglab.com/andrew/pub/neci-tr-96-029.ps|Negative-Cycle Detection Algorithms]</ref>. This is just a question, I am right now confused because of different sources describing a very different algorithm.

[[User:Vexorian|Vexorian]] ([[User talk:Vexorian|talk]]) 13:01, 17 January 2009 (UTC)