Python implementation of the single-source shortest-path algorithm defined in Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (Duan et al, 2025). Requires a networkx graph input.
The algorithm is theoretically faster than an optimized Dijkstra's, generalized to directed and undirected graphs.
Note
This project is an unoptimized work-in-progress for my own edification, testing, and benchmarking.