The problem is to find the earliest starting times for all operations. This problem generalizes the shortest path problem and the critical path problem. The complexity of the suggested algorithm is O ...

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

And a question lead me to think, how to determine if a shortest-path is unique (I want to know is a min-cut is unique).<BR><BR>This is standard Dijkstra stuff, undirected weighted graph (all edges ...

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

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.