DMMSY-SSSP: C99 implementation achieving O(log^(2/3) n) Shortest Path on Large Graphs (STOC 2025)
Summary
DMMSY is a high-performance C99 implementation of a directed single-source shortest path algorithm that breaks the traditional sorting barrier with O(log^(2/3) n) complexity. It employs zero-allocation memory, cache-optimized CSR storage, and recursive subproblem decomposition to deliver large-speedups over Dijkstra on massive sparse graphs; the repo references STOC 2025 work and provides build and benchmarking guidance.