Bellman-Ford algorithm

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

Portuguese: algoritmo de Bellman-Ford m

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.