Bellman-Ford algorithm

ˈbɛlmən fɔrd ˈælɡəˌrɪðəm
Translation Definition
NEW

Translation of Bellman-Ford algorithm into German

Noun

graph theory

TECH.
algorithm finding shortest paths in weighted graphs
TECH.
Bellman-Ford-Algorithmus
  • The Bellman-Ford algorithm efficiently handles negative weights.Der Bellman-Ford-Algorithmus bewältigt effizient negative Gewichte.
Add a suggestion |

Synonyms and analogies of Bellman-Ford algorithm in English

Examples of Bellman-Ford algorithm in a sentence

  • Students learn the Bellman-Ford algorithm in advanced computer science courses.

Translations of "Bellman-Ford algorithm" in Context ordered by category and frequency

Bellman-Ford-Algorithmus
Explore more translations and examples on Reverso Context

Bellman-Ford algorithm: Examples and translations in context

Negative cycles can be found by running the Bellman-Ford algorithm.

Negative Kreise in einem Graphen kann man beispielsweise über den Bellman-Ford Algorithmus finden.

The method according to claim 11 wherein said step of identifying principal paths (43) includes the step of utilizing a Bellman-Ford algorithm (FIG. 6).

Verfahren nach Anspruch 11, wobei der Schritt der Feststellung von Hauptpfaden (43) den Schritt der Verwendung eines Bellman-Ford-Algorithmus (FIG. 6) beinhaltet.

In such a case, the Bellman-Ford algorithm can detect negative cycles and report their existence.

Der Bellman-Ford-Algorithmus kann das Vorhandensein von Zyklen negativen Gewichtes erkennen.

Since the new residual graph might still contain other cycles, the algorithm has to iterate and run the Bellman-Ford algorithm again.

Da der Residualgraph aber natürlich immer noch andere Kreise enthalten kann, iteriert der Algorithmus und sucht über den Bellman-Ford Algorithmus nochmals nach negativen Kreisen.

This paper proposes an expert system as a solution that combines traditional path finding algorithms (in the form of a modified version of the A* and the Bellman-Ford algorithm) with a fuzzy inference system that incorporates the human knowledge of AGV system planners.

Dieses Paper stellt eine Lösung vor: Ein Expertensystem, das klassische Wegfindungsalgorithmen mit einem Fuzzy-System kombiniert und somit das Expertenwissen von menschlichen Wegenetzplanern einfließen lässt.

We talked about distance vectors, the Bellman-Ford algorithm, the routing information protocol RIP, about link state according to Dijkstra, link state routing, OSPF and the border gateway protocol BGP.

Es geht um Distanz-Vektoren, den Bellman-Ford-Algorithmus, das Routing-Information-Protokoll RIP, um Link State nach Dijkstra, Link State Routing, OSPF und BGP.

Browse the dictionary entries starting with “b”:
Why use Reverso English-German Dictionary to learn "Bellman-Ford algorithm"?
  • Find accurate translations for "Bellman-Ford algorithm" in German

    Explore various translations of "Bellman-Ford algorithm" sorted by frequency and relevance to find the perfect match for your context.

  • Browse countless real-life examples

    Understand the exact meaning of "Bellman-Ford algorithm" and learn how to use it correctly in any context. Examples come from millions of authentic texts: movie dialogues, news articles, official documents, and more.

  • Listen to pronunciation

    Hear how "Bellman-Ford algorithm" is pronounced by native speakers and improve your oral skills.

  • Discover expressions and idioms with "Bellman-Ford algorithm" in English

    Dive into our dictionary's treasure trove of phrases and expressions containing "Bellman-Ford algorithm" to grow your vocabulary including new entries from the Reverso Collaborative Dictionary.

  • Create your vocabulary list with ease

    Click the star icon to save "Bellman-Ford algorithm" to your favorites.

  • Practice with flashcards

    Memorize your words with interactive flashcards containing audio and examples.

English-German translations you can rely on
Find virtually anything

Over 500,000 entries, 2 million translations and 10 million examples in context

Trusted by 70M users

including students, language teachers, and linguistic experts

Exceptional 4.7 app rating

with 250,000+ reviews on App Store and Play Store