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.
View all translations of Bellman-Ford algorithm
Click below to see the appropriate translations facing each meaning.
- French:algorithme de Bellman-Ford, ...
- German:Bellman-Ford-Algorithmus, ...
- Italian:algoritmo di Bellman-Ford, ...
- Spanish:algoritmo de Bellman-Ford, ...
- Portuguese:algoritmo de Bellman-Ford, ...
- Chinese:Bellman-Ford算法, ...
- Japanese:ベルマンフォードアルゴリズム, ...
- Arabic:خَوَارِزْمِيَّة بيلمان-فورد, ...
- Hebrew:אַלְגוֹרִיתְם בֶּלְמַן-פוֹרְד, ...
- Russian:алгоритм Беллмана-Форда, ...
- Ukrainian:алгоритм Беллмана-Форда, ...
- Hindi:बेलमैन-फोर्ड एल्गोरिदम, ...
icon to discover related terms: analogies, antonyms, common collocates, words with same roots, umbrella terms… Try with happening or hunch.
icon next to the first example to see two additional options and learn to use new vocabulary naturally.
icon to save words you want to revisit. You can also save a specific meaning by clicking on the