* Why do you want to base this on Dijkstra's algorithm, which is designed to find a single shortest-path? Surely there are better options for your base implementation. A quick Google search suggests a ...

Here is a problem I'm working on. Say you have a weighted, directed graph with n vertices and m edges, and you want to find the shortest path from s to all other vertices, *but* you can only use some ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...