Bellman-Ford algorithm
ˈbɛlmən fɔrd ˈælɡəˌrɪðəm
Definition

Definition of Bellman-Ford algorithm - Reverso English Dictionary

Noun

graph theoryTECH.algorithm finding shortest paths in weighted graphsTECH.
  • The Bellman-Ford algorithm efficiently handles negative weights.
  • The Bellman-Ford algorithm is useful in network routing protocols.
  • Students learn the Bellman-Ford algorithm in advanced computer science courses.
algorithm method procedure
Add a suggestion |

View all translations of Bellman-Ford algorithm

Click below to see the appropriate translations facing each meaning.
  1. French:algorithme de Bellman-Ford, ...
  2. German:Bellman-Ford-Algorithmus, ...
  3. Italian:algoritmo di Bellman-Ford, ...
  4. Spanish:algoritmo de Bellman-Ford, ...
  5. Portuguese:algoritmo de Bellman-Ford, ...
  6. Chinese:Bellman-Ford算法, ...
  7. Japanese:ベルマンフォードアルゴリズム, ...
  8. Arabic:خَوَارِزْمِيَّة بيلمان-فورد, ...
  9. Hebrew:אַלְגוֹרִיתְם בֶּלְמַן-פוֹרְד, ...
  10. Russian:алгоритм Беллмана-Форда, ...
  11. Ukrainian:алгоритм Беллмана-Форда, ...
  12. Hindi:बेलमैन-फोर्ड एल्गोरिदम, ...
Browse the dictionary entries starting with “b”:

Discover how Reverso redefines the dictionary

Go beyond “simple words”

Get more than a simple definition

Go from understanding to mastery