Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01509211n
Noun Concept
Categories: All articles needing additional references, Dynamic programming, Polynomial-time problems, Graph algorithms, Graph distance
EN
Bellman–Ford algorithm  Bellman Ford algorithm  Bellman-Ford  Bellman-Ford-Moore  Bellman-Ford-Moore algorithm
EN
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Wikipedia
Definitions
Relations
Sources
EN
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Wikipedia
A method for finding shortest paths Wikipedia Disambiguation
Algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative Wikidata
DERIVATIVE WORK
Routing Information Protocol
DISCOVERER OR INVENTOR
Edward F. Moore
L. R. Ford, Jr.
Richard E. Bellman
NAMED AFTER
L. R. Ford, Jr.
Richard E. Bellman
SOLVES
shortest path problem
USES
graph
Wikipedia
EN
Bellman–Ford algorithm
Wikidata
EN
Bellman–Ford algorithm
Wikipedia Redirections
EN
Bellman-Ford, Bellman-Ford-Moore, Bellman-Ford-Moore algorithm, Bellman-Ford algorithm, Bellman-Shimbel, Bellman-Shimbel algorithm, Bellman Ford, Bellman Ford algorithm, Bellman Ford Algorithm, Bellman Ford Moore, Bellman Ford Moore algorithm, Bellman Shimbel, Bellman Shimbel algorithm, Bellman–Ford, Bellman–Ford–Moore, Bellman–Ford–Moore algorithm, Bellman–Shimbel, Bellman–Shimbel algorithm, Belman-Ford, Belman-Ford algorithm, Ford-Bellman, Shimbel's algorithm
Wikidata Alias
EN
Bellman–Ford–Moore algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License