Re:On Dijkstra's Algorithm
by lorenzhs on Wednesday April 22, 2015 @07:06AM
(#9419558)
During relaxation (if you found a new, shorter path to a node), you don't just update the cost of getting there, but also save how you got there (i.e., from which node). Then it's just a matter of retracing the steps from B to A!
[ Parent
| on HN ]
There are no comments on this comment yet.