Bellman–Ford algorithm

Summary

Bellman–Ford algorithm is a pathfinding algorithm^[1]. It draws 608 Wikipedia views per month (pathfinding_algorithm category, ranking #3 of 5).^[2]

Key Facts

• Bellman–Ford algorithm is credited with the discovery of Richard E. Bellman^[3].
• Bellman–Ford algorithm is credited with the discovery of L. R. Ford, Jr.^[4].
• Bellman–Ford algorithm is credited with the discovery of Edward F. Moore^[5].
• Bellman–Ford algorithm's image is recorded as Bellman–Ford algorithm example.gif^[6].
• Bellman–Ford algorithm's instance of is recorded as pathfinding algorithm^[7].
• Bellman–Ford algorithm's instance of is recorded as graph algorithm^[8].
• Bellman–Ford algorithm's instance of is recorded as mathematical concept^[9].
• Richard E. Bellman is named after Bellman–Ford algorithm^[10].
• L. R. Ford, Jr. is named after Bellman–Ford algorithm^[11].
• Bellman–Ford algorithm's Commons category is recorded as Bellman–Ford algorithm^[12].
• Bellman–Ford algorithm's Freebase ID is recorded as /m/01g933^[13].
• Bellman–Ford algorithm's used by is recorded as distance-vector routing protocol^[14].
• Bellman–Ford algorithm's computes solution to is recorded as shortest path problem^[15].
• Bellman–Ford algorithm's computes solution to is recorded as single-source shortest path problem^[16].
• Bellman–Ford algorithm's uses is recorded as graph data structure^[17].
• Bellman–Ford algorithm's worst-case time complexity is recorded as \Theta (|V| |E|)^[18].
• Bellman–Ford algorithm's best-case time complexity is recorded as \Theta (|E|)^[19].
• Bellman–Ford algorithm's worst-case space complexity is recorded as \Theta (|V|)^[20].
• Bellman–Ford algorithm's derivative work is recorded as Routing Information Protocol^[21].
• Bellman–Ford algorithm's derivative work is recorded as Babel^[22].
• Bellman–Ford algorithm's Dictionary of Algorithms and Data Structures ID is recorded as bellmanford^[23].
• Bellman–Ford algorithm's Dictionary of Algorithms and Data Structures ID is recorded as FordBellman^[24].
• Bellman–Ford algorithm's Microsoft Academic ID is recorded as 2780110560^[25].
• Bellman–Ford algorithm's Brilliant Wiki ID is recorded as bellman-ford-algorithm^[26].
• Bellman–Ford algorithm's GitHub topic is recorded as bellman-ford-algorithm^[27].

Body

Designation and Status

Recorded instance of include pathfinding algorithm^[7], graph algorithm^[8], and mathematical concept^[9].

History and Context

Things named after include Richard E. Bellman^[10], a mathematician^[28], 1920–1984^[29], of United States^[30], awarded the John von Neumann Theory Prize^[31], specialised in applied mathematics^[32] and L. R. Ford, Jr.^[11], a mathematician^[33], 1927–2017^[34], of United States^[35].

Why It Matters

Bellman–Ford algorithm draws 608 Wikipedia views per month (pathfinding_algorithm category, ranking #3 of 5).^[2] It has Wikipedia articles in 22 language editions, a strong signal of global cultural recognition.^[36] It is known by 25 alternative names across languages and contexts.^[37]