Bellman-Ford algorithm
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after its developers, Richard Bellman and L. R. Ford, Jr.
Noun[edit]
Bellman-Ford algorithm (plural Bellman-Ford algorithms)
- (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[edit]
shortest-path algorithm
|