Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01509211n
Noun Concept
SYL
No term available
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
Relations
Sources
DERIVATIVE WORK
Routing information protocol
DISCOVERER OR INVENTOR
Edward F. Moore
EN
L. R. Ford, Jr.
Richard Bellman
NAMED AFTER
EN
L. R. Ford, Jr.
Richard Bellman
SOLVES
EN
shortest path problem
USES
EN
graph

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