A new algorithm has been developed that can find the shortest path to any point in record time. The algorithm's performance is being compared to Dijkstra's algorithm, a longstanding method for finding shortest paths, with some outlets suggesting it may be faster. However, it is unclear if the new algorithm will immediately replace existing methods in production use.