Bellman-Ford algorithm

noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

nounBellman-Ford algorithm (plural Bellman-Ford algorithms)

plural Bellman-Ford algorithms

  1. computingAn 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.

Origin

Named after its developers, Richard Bellman and L. R. Ford, Jr.

Full word history & related roots →

Translations

Portuguese algoritmo de Bellman-Ford
  • algoritmo de Bellman-Fordshortest-path algorithm
Cite this entry
APA

Bellman-Ford algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/Bellman-Ford%20algorithm

MLA

“Bellman-Ford algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Bellman-Ford%20algorithm. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “Bellman-Ford algorithm,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/Bellman-Ford%20algorithm.

Source: Bellman-Ford algorithm on Wiktionary, CC BY-SA 4.0.