|
|
Definition of Bellman-Ford algorithm
1. 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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Bellman-Ford Algorithm
Other Resources:
