Revision as of 06:45, 24 March 2009 edit Quuxplusone (talk \| contribs) Extended confirmed users 12,132 edits →Dijkstra is not greedy ← Previous edit		Revision as of 00:24, 8 April 2009 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →Implementation removed: new section 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--> == Implementation removed == I removed the "C implementation" section. This seems to be out of place in a wikipedia article. There is already the pseudocode, which conveys how that algorithm works. The C code is quite long, difficult to verify, and redundant. And a GFDL license is not really useful for sharing code. There is also a discussion at [http://en.wikipedia.org/wiki/Wikipedia_talk:WikiProject_Computer_science#Source_code_written_by_editors] that led me here. — Carl <small>([[User:CBM\|CBM]] · [[User talk:CBM\|talk]])</small> 00:24, 8 April 2009 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions