Bellman-Ford algorithm

Noun

Meaning

Bellman-Ford algorithm (plural Bellman-Ford algorithms)

English Wikipedia has an article on:Bellman-Ford algorithmWikipedia
(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.

Source: en.wiktionary.org

Close letter words and terms

bellmaking bellman Bellman equation Bellmawr bellmetal Bellmore