Bellman–Ford algorithm

Article
Talk

This is an old revision of this page, as edited by Docu (talk | contribs) at 14:54, 18 May 2003 (Stub from "List of algorithms"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Bellman-Ford algorithm computes shortest paths in a weighted graph (where some of the edge weights may be negative).

See also: List of algorithms

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bellman–Ford_algorithm&oldid=1057940"