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

From Algorithm Wiki

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.ezproxy.canberra.edu.au/doi/10.1145/363269.363610

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