Bellman-Ford algorithm

Noun.  (graphtheory) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

This is an unmodified, but possibly outdated, definition from Wiktionary and used here under the Creative Commons license. Wiktionary is a great resource. If you like it too, please donate to Wikimedia.

This entry was last updated on RefTopia from its source on 3/20/2012.