Bellman-Ford algorithm

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Etymology[edit]

Named after its developers, Richard Bellman and L. R. Ford, Jr.

Noun[edit]

Bellman-Ford algorithm (plural not attested)

Wikipedia has an article on:

Wikipedia

  1. (graph theory) 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.