NEW METHOD IS THE FASTEST WAY TO FIND THE BEST ROUTES

Summary from the TLDR newsletter

One of the most iconic problems in computer science is finding the shortest path from a specific starting point in a network to every other point. A team of researchers has devised a new algorithm that solves the problem without sorting, and it runs faster than any algorithm that does, including Dijkstra's algorithm. The new algorithm's runtime breaks the previous sorting barrier, and it can likely be streamlined to run even faster. This article tells the story of how the algorithm was developed.