Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(VE)$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1959 == Reference == https://www.ams.org/journals/qam/1958-16-01/S0033-569X-1958-0102435-2/S0033-569X-1958-0102435-2.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(V)$ | $O(V)$ words | ||
(keeping track of distances) | (keeping track of distances) | ||
Latest revision as of 07:55, 10 April 2023
Time Complexity
$O(VE)$
Space Complexity
$O(V)$ words
(keeping track of distances)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1959
Reference
https://www.ams.org/journals/qam/1958-16-01/S0033-569X-1958-0102435-2/S0033-569X-1958-0102435-2.pdf