DiogoRibeiro7 / bmssp
View external linksLinks

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.
27Feb 9, 2026Updated last week

Alternatives and similar repositories for bmssp

Users that are interested in bmssp are comparing it to the libraries listed below

Sorting:

Are these results useful?