Revision as of 13:02, 17 January 2009 edit Vexorian (talk \| contribs) 141 edits No edit summary ← Previous edit		Revision as of 13:04, 17 January 2009 edit undo Vexorian (talk \| contribs) 141 edits →A doubt: noticed I can't use refs in talk Next edit →
Line 41: == 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>[~~(http://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)

Talk:Bellman–Ford algorithm: Difference between revisions