The data below is a dynamic programming solution for a shortest route problem.

-Using the data in Table M2-1, determine the distance of stage 1 for the optimal route.
A)0
B)8
C)12
D)16

Question

The data below is a dynamic programming solution for a shortest route problem.

-Using the data in Table M2-1, determine the distance of stage 1 for the optimal route.
A)0 
B)8 
C)12 
D)16

Quizplus · Accepted Answer

The distance of stage 1 for the optimal route can be found in the first row of the table. The values in the first row represent the shortest distance from node 1 to each of the other nodes. Looking at the column for node 2, we can see that the shortest distance from node 1 to node 2 is 8. Therefore, the answer is B)8.

The Data Below Is a Dynamic Programming Solution for a Shortest