Bellman–Ford algorithm

algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
Pathfinding Algorithm Q816022

Facts

10 properties

Identity

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]
Worst-case space complexity
\Theta (|V|)[15]
Worst-case time complexity
\Theta (|V| |E|)[13]
🏷️ Also known as
en Bellman-Ford equation en Bellman–Ford algorithm en distance-vector routing algorithm en Bellman–Ford–Moore algorithm ar خوارزمية بلمان فورد cs Bellman-Fordův algoritmus cs Bellmanův-Fordův algoritmus de Bellmann-Ford de Moore-Bellman-Ford-Algorithmus de Bellman-Ford-Moore-Algorithmus de Bellman-Ford-Algorithmus de Bellman-Ford de Algorithmus von Bellman und Ford es algoritmo de Bellman–Ford fa الگوریتم بلمن-فورد fa الگوریتم بلمن–فورد fi Bellmanin–Fordin algoritmi fr algorithme de Bellman-Ford fr algorithme de Ford-Bellman fr Bellman-Ford
🔖 Identifiers · 6
Brilliant Wiki ID
bellman-ford-algorithm
Dictionary of Algorithms and Data Structures ID
bellmanford, FordBellman
Freebase ID
/m/01g933
Microsoft Academic ID (discontinued)
2780110560

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
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
Press Enter · cited answer in seconds

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].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [5] ↑ . wikidata.org.
  2. [6] ↑ . wikidata.org.
  3. [2] ↑ . wikidata.org.
  4. [3] ↑ . wikidata.org.
  5. [4] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.
  15. [16] ↑ . RFC 2453: RIP Version 2. Retrieved . wikidata.org.
  16. [17] ↑ . RFC 6126: The Babel Routing Protocol. Retrieved . wikidata.org.

Inline context (facts about related entities)

  1. [18] ↑ . Wikidata. wikidata.org. → on this site
  2. [19] ↑ . Wikidata. wikidata.org. → on this site
  3. [20] ↑ . Wikidata. wikidata.org. → on this site
  4. [21] ↑ . Wikidata. wikidata.org. → on this site
  5. [22] ↑ . Wikidata. wikidata.org. → on this site
  6. [23] ↑ . Wikidata. wikidata.org. → on this site
  7. [24] ↑ . Wikidata. wikidata.org. → on this site
  8. [25] ↑ . Wikidata. wikidata.org. → on this site

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Bellman–Ford algorithm. Retrieved November 15, 2026, from https://4ort.xyz/entity/bellman-ford-algorithm
MLA “Bellman–Ford algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 15 Nov. 2026, https://4ort.xyz/entity/bellman-ford-algorithm.
BibTeX @misc{4ortxyz_bellman-ford-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Bellman–Ford algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/bellman-ford-algorithm}, note = {Accessed: 2026-11-15}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Bellman–Ford algorithm — https://4ort.xyz/entity/bellman-ford-algorithm (retrieved 2026-11-15)

Canonical URL: https://4ort.xyz/entity/bellman-ford-algorithm · Last refreshed: