Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (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")

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

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bellman–Ford_algorithm_(Shimbel_1955;_Bellman_1958;_Moore_1959)_(general_weights_Shortest_Path_(Directed_Graphs))&oldid=44611"