I did a writeup on substack on BMSSP (the supposed Dijkstra killer) that folks on HN might enjoy. Included is also a technical deep dive into the algorithm (
https://rohanparanjpe.substack.com/p/breaking-the-shortest-p...) and the implementation on github (
https://github.com/rap2363/ssps).
