HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie  
Podcast: Heavy Networking
Published On: Fri May 01 2026
Description: Dijkstra’s algorithm is the foundation of shortest path calculations for link state routing protocols. But researchers have developed a new algorithm that improves on this decades-old approach. Today’s Heavy Networking welcomes Dr. Bruce Davie to discuss the potential of this new algorithm to unseat Dijkstra. After thoughtful consideration, and consultation with others, his opinion is... Read more »