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

Bellman-Ford algorithm

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

CEFR level

B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.
See all B2 English words →

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

Know this word better than we do? Language is a living thing — help us keep it growing. Collaborate with Babel Free