← Heavy Networking
Heavy Networking
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie
00:54:43
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. T…
Loading summary