First C# implementation of the STOC 2025 algorithm that breaks Dijkstra's 50-year O(m log n) sorting barrier for shortest paths — 49× fewer heap operations, 97 tests, 28/28 correctness
computer-science csharp algorithms graph-algorithms dotnet priority-queue data-structures dijkstra shortest-path bellman-ford single-source-shortest-path sssp research-implementation stoc-2025 comparison-model
-
Updated
Mar 20, 2026 - C#