bmssp
Publicssspx 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.
algorithmsbenchmarkingbmsspclidata-structuresdijkstragraph-algorithmsgraph-theorynetwork-analysisoptimization
Creat：2025-08-12T03:35:24
Update：2025-10-18T05:08:27
26
Stars
0
Stars Increase