Can a theoretically faster shortest-path algorithm win on real graphs?
We implemented BMSSP (STOC 2025 Best Paper) in NeuG. On two public Graphalytics graphs, it beat NeuG's frontier by 4.5–13.5% and Dijkstra by ~13.5×.
neug.io/blog/bmssp-sho…
#NeuG #GraphDatabase #SSSP
