Bellman-Ford algorithm en · NOUN
Etymology
Named after its developers, Richard Bellman and L. R. Ford, Jr.
Meanings
- 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.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| Bellman-Ford algorithms | Number=Plur | lexicographic |
Translations (1)
pt algoritmo de Bellman-Ford (shortest-path algorithm)