And, most importantly: * 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.

Edsger Dijkstra, seen here in 2002, developed a classic algorithm for rapidly finding the shortest paths through a network. Hamilton Richards In an interview toward the end of his life, Dijkstra ...

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