HomeServicesBlogDictionariesContactSpanish Course
Home › Dictionary › English › Bellman-Ford algorithm
← Back to search

Meaning of Bellman-Ford algorithm | Babel Free

Noun CEFR B2

Definitions

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.

Equivalents

Português algoritmo de Bellman-Ford

CEFR level

B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.

See also

bellmanship Bellmawr Bellmen Bellmore Bellmount Forest bellmouth

Learn this word in context

See Bellman-Ford algorithm used in real conversations inside our free language course.

Start Free Course