I Came across this paper : Breaking the Sorting Barrier for Directed Single-Source Shortest Paths ([2504.17033] Breaking the Sorting Barrier for Directed Single-Source Shortest Paths)
Which seems to be a new fastest way to calculate shortest path.
Just bringing this to your attention to see if it would make its way into Graphhopper !
Thanks for the link. Except for fully flexible routing GraphHopper uses speed up techniques like CH and LM that allow even faster route calculations by preprocessing the graph before answering routing queries. For flexible routing a faster algorithm would be interesting indeed, but unfortunately the authors do not show any real experiments with their algorithm. They only show the time complexity is better than for Dijkstra’s algorithm, so it is not obvious that it would be an improvement in practice.
This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.