* 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 ...

A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

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 ...

In this paper we consider specific directed graphs called "ladders". The vertices of the graph are randomly colored by green or red. Deleting the edges with at least one red endpoint one gets a random ...