dictionary · English Wiktionary
bellman-ford algorithm
Pronunciation B EH1 L M AH0 N F ER0 D AE0 L G ER0 IH0 DH AH0 M1 definition(s) across 1 part(s) of speech · fetched 2026-11-19
Noun1 sense
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.