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

Ronald Boskovic, Paul Belcher, 83.03 A Teaching Note on Dijkstra's Shortest Path Algorithm, The Mathematical Gazette, Vol. 83, No. 497 (Jul., 1999), pp. 251-254 ...

But solving the single source shortest path problem has allowed researchers to create a superb algorithm that becomes almost impossible to beat with regards to speed.

This is a preview. Log in through your library . Abstract In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.