Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs))

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E+LV)$ == Space Complexity == $O(V+L)$ words (keep track of vertices and L most recent buckets) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1969 == Reference == https://dl.acm.org/doi/10.1145/363269.363610")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(E+LV)$

Space Complexity

$O(V+L)$ words

(keep track of vertices and L most recent buckets)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1969

Reference

https://dl.acm.org/doi/10.1145/363269.363610

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dial%27s_Algorithm_(nonnegative_integer_weights_Shortest_Path_(Directed_graphs))&oldid=45087"