nowfound

Life & fun · February 23, 2026

C99 implementation of new O(m log^(2/3) n) shortest path algorithm

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) - danalec/DMMSY-SSSP

C99 implementation of new O(m log^(2/3) n) shortest path algorithm launched on February 23, 2026 with 111 votes, #307 of 16,627 launches that month and more than 95% of that year's launches.

Visit github.com ↗Alternativestop 2% of February 2026

In plain words

This is a C99 implementation of a shortest path algorithm that achieves O(m log^(2/3) n) time complexity. It is designed for developers and computer scientists who need efficient graph algorithms for computational problems. The implementation provides a practical realization of this theoretical algorithm, available as open-source code on GitHub.

written from the facts on this page · September 2026

From the sources

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin, "Breaking the Sorting Barrier for Directed Single-Source Shortest Paths" , STOC 2025. DMMSY provides a robust and efficient backend for solving SSSP problems on large-scale sparse graphs. By leveraging a recursive subproblem decomposition rather than a strict global priority queue, this implementation breaks the long-standing $O(m + n \log n)$ complexity barrier, delivering speedups exceeding 20,000x over standard Dijkstra implementations. Tests conducted on a modern x86_64 architecture using Clang -O3 with LTO and Fast-Math optimizations. On sparse tree-like graphs with GCC auto-vectorization ( -O3 -march=native ), DMMSY achieves…from github.com

Does a similar job

all alternatives →
  • BFS, Dijkstra and A* interactive demo made in React2021 · github.com · ▲94

    Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood - npretto/pathfinding

  • A hash array-mapped trie implementation in C2023 · github.com · ▲171

    Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…

  • DS
    Dijkstra’s algorithm in the web browser with OpenStreetMap2016 · christophercliff.com · ▲158
  • A pure C89 implementation of Go channels, with blocking selects2023 · github.com · ▲271

    A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects. - GitHub - rochus-keller/CspChan: A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects.

  • Visual A* pathfinding and maze generation in Python2024 · github.com · ▲135

    I was fascinated reading through another recent HN submission about a highly efficient implementation of A* in Lisp, which got me thinking about how I could do something similar in Python. However, these kinds of pathfinding algorithms really need complex terrain/mazes with interesting obstructions to showcase what they can do and how they work. So, I started thinking about how I could generate cool and diverse random "mazes" (they aren't really mazes, but I'm not sure what the best term is). I got a bit carried away thinking of lots of different cool ways to generate these mazes, such…

  • Algorithms and Data Structures in TypeScript – Free Book (~400 Pages)Mar 2026 · amoilanen.github.io · ▲65

    I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, February 2026

the whole month →
  • Rork Max▲1,428

    Best AI for iOS apps. Website that replaces Xcode

    Life & fun · Feb 2026 · rork.com

  • happycapy▲1,365

    The agent-native computer, for the rest of us

    AI · Feb 2026 · happycapy.ai

  • SuperX▲897

    All-in-one growth OS for serious 𝕏 creators

    AI · Feb 2026 · superx.so

  • KiloClaw▲868

    Hosted OpenClaw. No Mac mini required.

    Dev tools · Feb 2026 · kilo.ai

  • Lovon AI Therapy▲801

    Feel closer and have more fun with your partner every day!

    AI · Feb 2026 · lovon.app

  • I spent 3 years reverse-engineering a 40 yo stock market sim from 1986▲721

    Hello my name is Ben Ward for the past 3 years I have been remastering the financial game Wall Street Raider created by Michael Jenkins originally on DOS in 1986. It has been a rough journey but I finally see the light at the end of the tunnel. I just recently redid the website and thought maybe the full story of how this project came to be would interest you all. Thank you for reading.

    Work · Feb 2026 · wallstreetraider.com