ssspx is a clean, typed, and tested implementation of a deterministic Single‑Source Shortest Paths solver for directed graphs with non‑negative weights. It follows a BMSSP‑style divide‑and‑conquer design (levels, FindPivots, bounded base case) and includes a switchable frontier, an optional constant‑outdegree transform.

bounded multi-source shortest paths benches in Rust, C, C++, Nim, Crystal, Kotlin (JAR), Elixir (.exs), Erlang (.erl).

Bounded Multi-Source Shortest Path algorithm implemented in go

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (BMSSP) algorithm - Java implementation

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

A Rust implementation of the BMSSP (Bounded Multi-Source Shortest Path) algorithm

TypeScript SDK for Single-Source and Bounded Multiple Source Shortest Path (SSSP/BMSSP) algorithms. Includes Dijkstra with binary heap, designed for modern graph apps and research.