Does Dijkstra's Algorithm Go Backwards?

[A_StClaire_]

hi,

I am trying to do this thing in C# and was wondering if it's customary
for the algorithm to backtrack. is its purpose only to find the
shortest path from a to z, or does one normally implement it backward
(i.e., z to a) after going forward?

obviously we are assuming edges may not be equal when reversing
directions (e.g., takes longer to go from b to a than from a to b).

thx for your help

 

[Bruce Wood]

A quick Google search turned up this step-by-step Java version on line.
It doesn't tell you how to program it, but it does show you the
algorithm working one pass at a time:

http://carbon.cudenver.edu/~hgreenbe/sessions/dijkstra/DijkstraApplet.html

 

[Bill Butler]

hi,

I am trying to do this thing in C# and was wondering if it's customary
for the algorithm to backtrack. is its purpose only to find the
shortest path from a to z, or does one normally implement it backward
(i.e., z to a) after going forward?

obviously we are assuming edges may not be equal when reversing
directions (e.g., takes longer to go from b to a than from a to b).

thx for your help

Try this
http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html#S2

Bill