How Dijkstra's Algorithm finds shortest paths to real-world maps, shows up in unexpected🙌🏻 Chinese scientists have developed the best shortest-path algorithm in 41 years! A team from Tsinghua University has broken Dijkstra's "sorting barrier" - The first improvement since 1984. The new algorithm runs in O(m |log^ {2/3} n) time. Potential applications? Faster, shorter waits for route calculations, fewer traffic jams, cheaper deliveries, and more efficient computer networks. paper - arxiv.org/pd

[PDF] Adam: A Method for Stochastic Optimization | Semantic Scholar