Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
Jump to navigation
Jump to search
Time Complexity
$O(V^{2} \log V)$
Space Complexity
$O(E)$ (total) words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1960
Reference
https://www-jstor-org.ezproxy.canberra.edu.au/stable/pdf/2627005.pdf