Faster than Dijkstra?
Summary
The article discusses a new shortest-path algorithm that claims to outperform Dijkstra by removing the need for sorting, with practical implications for routing protocols like OSPF/IS-IS. It emphasizes real-world considerations such as network scale, convergence time, and the enduring practicality of simpler, well-understood approaches, concluding that Dijkstra remains dominant in production routers for now.