Phrase guide

Bellman-Ford algorithm

noun · 1 senses · updated from the 2026-07-25 local source snapshot

Definitions and examples are grouped by meaning. Pronunciation, history, word forms, translations, descendants, synonyms, antonyms, derived terms, and related words appear whenever the source provides them.

Sound

Pronunciation

Each Play button uses your device's default local English voice, or a natural local fallback. The selected voice name appears after playback. This is synthesized speech, not a source recording.

No pronunciation record was provided for this word.

1

noun

Meaning 1

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.

Definition source: English Wiktionary via Wiktextract

Topics: computing, engineering, graph-theory, mathematics, natural-sciences, physical-sciences, sciences

No example sentence was provided for this meaning.

Meaning relationships

Synonyms: none provided

Antonyms: none provided

History

Etymology

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

Across languages

Translations

1 source translations are retained for this English entry.

  • Portuguese: algoritmo de Bellman-Ford — shortest-path algorithm