DiogoRibeiro7 / bmsspView on GitHub
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.
☆26Sep 7, 2026Updated last month

Alternatives and similar repositories for bmssp

Users that are interested in bmssp are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.

Sorting:

Are these results useful?