CodePlexProject Hosting for Open Source Software
Suppose I have a directed weighted graph, where I have used Dijkstra to calculate the shortest path from O to D.
Then I add one link somewhere in the graph. I am sure there is a way to update the shortest-path-tree without having to restart the SP algo?
/A
Update on updating the shortest-path-tree without having to restart the SP algo....
I found an algorithm in Figure 4.5 in
http://www.springerlink.com/content/d126702146j65554/fulltext.pdf
So, let's see how to implement this one in QuickGraph....
Thanks for the link!
Are you sure you want to delete this post? You will not be able to recover it later.
Are you sure you want to delete this thread? You will not be able to recover it later.