Rozhoň suggested they try to devise a universally optimal algorithm for the single-source shortest-paths problem. “I said, ‘No, but that’s not possible; that just cannot be done ...

But a new proof shows that for the quintessential path-finding problem, one algorithm is close to ideal: Assuming worst-case traffic patterns, it’s the best approach on every possible street grid.

Classic math conundrum solved: Superb algorithm for finding the shortest route. ScienceDaily . Retrieved May 23, 2025 from www.sciencedaily.com / releases / 2021 / 03 / 210310204242.htm ...

“This is a philosophical question that I’m trying to understand,” Nanongkai said. “This shortest-path problem gives some hope.” Correction: January 20, 2023 The original version of this article ...

To work out whether the routes chosen by the algorithm are really more beautiful, Quercia and co recruited 30 people who live in London and are familiar with the area, to assess the recommended paths.

The algorithm works by cycling through all possible pathways between two points. Once all of the potential routes have been measured, the shortest path can be identified.

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.