Hi All,

My Fiancee is doing a degree in computer science. She is currently having a tough time on a certain aspect and I wonder if anyone can help. I am more telecoms based so forgive me for the format of the question.

Using the Dijkstra Algorithm of finding the shortest path between 2 points, how do you modify the code or algorithm etc if one of the points has moved.

For example (what she gave me) shortest point between 2 cities on a map.. either One of the cities has moved or there is roadworks etc. how to modify the code to take this into account.

I can provide a more detailed description if this is no good.

Thanks in advance

Steve

I am not familiar with this particular algorithm.  Could you post the relevant portion?

_________________
Bob Rashkin