Bellman–Ford algorithm
Facts
10 propertiesIdentity
- Instance of
- pathfinding algorithm, graph algorithm, mathematical concept[5][6]
More facts +9
- Best-case time complexity
- \Theta (|E|)[14]
- Computes solution to
- shortest path problem, single-source shortest path problem[10][11]
- Derivative work
- Routing Information Protocol, Babel[16][17]
- Discoverer or inventor
- Richard E. Bellman, L. R. Ford, Jr., Edward F. Moore[2][3][4]
- Named after
- Richard E. Bellman, L. R. Ford, Jr.[7][8]
- Worst-case space complexity
- \Theta (|V|)[15]
- Worst-case time complexity
- \Theta (|V| |E|)[13]
- Image (Wikimedia Commons)
- Bellman–Ford algorithm example.gif ↗
- Brilliant Wiki ID
- bellman-ford-algorithm
- Dictionary of Algorithms and Data Structures ID
- bellmanford, FordBellman
- Freebase ID
- /m/01g933
- GitHub topic
- bellman-ford-algorithm
- Microsoft Academic ID (discontinued)
- 2780110560
Discoverer or inventor 3
Derivative work 2
Named after 2
← Based on 2
Computes solution to 1
Created notable works 1
Used by 1
Uses 1
← Uses 1
0 sources
Summary
Bellman–Ford algorithm is a pathfinding algorithm[1].
Body
History and Context
Things named after include Richard E. Bellman[7], a mathematician[18], 1920–1984[19], of United States[20], awarded the John von Neumann Theory Prize[21], specialised in applied mathematics[22] and L. R. Ford, Jr.[8], a mathematician[23], 1927–2017[24], of United States[25].