English Explanatory Dictionary

Bellman-Ford algorithm

English dictionary entry

Meanings

noun
  1. 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.

Word forms

Bellman-Ford algorithm Bellman-Ford algorithms

Etymology

Named after its developers, Richard Bellman and L. R. Ford, Jr.

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.
Back to search All on B Russian dictionary Dahl dictionary