Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))
Jump to navigation
Jump to search
Time Complexity
$O(E + V min(log log V, log log L))$
Space Complexity
$O(V)$? ("linear-space queue") words
(https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
2004