411 REFERENCE · Wiktionary
Bellman-Ford algorithm
Reference material by Wiktionary contributors. This retains its source identity and is not 411 news reporting.
English
Etymology
Named after its developers, Richard Bellman and L. R. Ford, Jr.
Noun
en graph theory computing 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.
Translations
shortest-path algorithm
Portuguese: pt algoritmo de Bellman-Ford m
en eponyms