medium10 pts · first answer countsgraphsshortest-path

Rebuilding the route, not just its cost

Dijkstra gives you the shortest distance to each warehouse. How do you also return the actual route?

A.Store parent[v] = u when relaxing, then walk back from the targetB.Run Dijkstra a second time, starting from the targetC.Sort all nodes by their final distance and list themD.Keep a full copy of the path at every node as you go

Discussion 0

Join free to post in the discussion.

Rebuilding the route, not just its cost

Discussion 0

Related questions