Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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/stable/pdf/2627005.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bellman–Ford_algorithm_(Dantzig_1960)_(Nonnegative_Weights_Shortest_Path_(Directed_Graphs))&oldid=46969"