Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs))
Jump to navigation
Jump to search
Time Complexity
$O(V^{2} EL)$
Space Complexity
$O(E)$ words
(number of equations in LP; each equation has a constant number of variables)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1956