A Deep Dive into Apple's .car File Format
Summary
The article critiques a new shortest-path algorithm claimed to beat Dijkstra by removing sorting requirements, examining its theoretical performance and practical impact on real routing systems like OSPF/IS-IS. It emphasizes that in networks, wall-clock convergence depends on much more than the core path computation, including link-state propagation, failure detection, and hardware updates. The author also notes that Dijkstra remains easier to understand and widely used in production routers.