bellman-ford algorithm

Fetched 2026-10-26 (cache).

Datamuse reports no synonyms or antonyms for this word.

Noun

1. {{lb|en|graph theory|computing}} An [[algorithm]] that computes single-source shortest [[path]]s in a [[weighted]] [[digraph]], capable (unlike the faster [[Dijkstra's algorithm]]) of handling graphs with [[negative]] edge weights.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.