danalec/DMMSY-SSSP
View on GitHub ↗ ★ 89 C
Experimental C implementation of “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths” by Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin (STOC 2025)
3 mentions on Hacker News by 2 people: 2 stories, 1 comment · first 2026-02-23 · latest 2026-02-23
20082026
-
▲ 2
Issues with "C99 implementation of new O(m log^(2/3) n) shortest path algorithm"story by dunmalg · 2026-02-23 · 0 comments
-
…The DMMSY core runs in ~800ns for 1M nodes. *Paper:* https://arxiv.org/pdf/2504.17033 *GitHub:* https://github.com/danalec/DMMSY-SSSP This is experimental—focused on correctness first. Would love feedback on edge cases, better…
comment by danalec · 2026-02-23 · in Show HN: C99 implementation of new O(m log^(2/3) n) shortest path algorithm -
▲ 111
Show HN: C99 implementation of new O(m log^(2/3) n) shortest path algorithmstory by danalec · 2026-02-23 · 28 comments