Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs))
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