In solving a shortest-route problem using dynamic programming,the stages represent how many arcs you are from the terminal node.

Question

Quizplus · Accepted Answer

In dynamic programming, the stages represent the progress made in solving the problem, rather than the distance from the terminal node. In a shortest-route problem, the stages could represent the nodes visited so far in the pathfinding process.

In Solving a Shortest-Route Problem Using Dynamic Programming,the Stages Represent