Bellman-Ford algorithm
Hello, you have come here looking for the meaning of the word Bellman-Ford algorithm. In DICTIOUS you will not only get to know all the dictionary meanings for the word Bellman-Ford algorithm, but we will also tell you about its etymology, its characteristics and you will know how to say Bellman-Ford algorithm in singular and plural. Everything you need to know about the word Bellman-Ford algorithm you have here. The definition of the word Bellman-Ford algorithm will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofBellman-Ford algorithm, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.
English
Etymology
Named after its developers, Richard Bellman and L. R. Ford, Jr.
Noun
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
shortest-path algorithm
|