Researchers Develop Optimal Map Navigation Algorithm
Originally Published 1 year ago — by WIRED
Researchers have proven that a version of Dijkstra's algorithm, a classic path-finding method developed in 1956, is the best approach for solving the single-source shortest-paths problem across any street grid, assuming worst-case traffic patterns. This algorithm, which is a staple in computer science education, has been shown to be universally optimal, meaning it performs best on every possible network layout. The breakthrough was achieved by focusing on the data structure used in the algorithm, leading to a simpler and more efficient design.