I did not. The html was generated by Deepseek. Claude is far way too expensive for that. This is only an experimental code. I don't think it is worth to pay Claude to test a code which was already peer reviewed theoretically.
7950X3D has 96MB L3 cache and the the graph is very sparse and tree-like.
It reaches 20.000x without fast-math against supposed alledged "custom dijkistras" in my specific setup. And you're free to test against your own dijkstras...
Some individuals are reaching >900.000x using fast-math! Have they tried the Rust version? (add -rs in the url)
I implemented the STOC 2025 Best Paper Award winner in C99. The algorithm achieves O(m log^(2/3) n) complexity, breaking the 65-year-old sorting barrier for sparse directed SSSP that Dijkstra established at O(m + n log n).
*Key implementation details:*
- Cache-optimized CSR layout for maximum spatial locality
- Zero-allocation design with pre-allocated workspaces
- Recursive subproblem decomposition instead of global priority queues
*Benchmarks:* On graphs with 250k–1M nodes, this shows 20,000x+ speedups over standard Dijkstra implementations. The DMMSY core runs in ~800ns for 1M nodes.
This is experimental—focused on correctness first. Would love feedback on edge cases, better decomposition strategies, or cache-oblivious optimizations I might have missed.
- 7950X3D has 96MB L3 cache and the the graph is very sparse and tree-like
- The code is opensource and everyone is welcome to contribute. Thanks for the idea.