Radio and PodcastRadio and PodcastLive Radio & Podcasts
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie artwork
Technology

HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie

Packet Pushers - Full Feed by Packet Pushers

May 1, 202654:43Technology

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 Networ...

About This Episode

HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie is an episode from Packet Pushers - Full Feed by Packet Pushers. Dijkstra’s algorithm is the foundation of shortest path calculations for link state routi...

Podcast

This episode belongs to Packet Pushers - Full Feed.

Listen Online

Use the player on this page to stream the episode online.

Episode Details

Published May 1, 2026, 54:43 long, audio available.

Related Episodes

Continue listening to more episodes from Packet Pushers - Full Feed.