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

I'm sitting here, and doing some homework, flow networks. 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 ...

the shortest path simplex algorithm (SPS), has not been analyzed thoroughly, and it is not generally known that certain variants of this algorithm have the same complexity bound of 0(n3) as the best ...