-The above information describes a shortest-route problem with the distance in miles.How many stages will this dynamic programming problem have?
A)8
B)4
C)3

Question

-The above information describes a shortest-route problem with the distance in miles.How many stages will this dynamic programming problem have?
A)8 
B)4 
C)3

Quizplus · Accepted Answer

The number of stages in a shortest-route problem is typically one less than the number of nodes, assuming a straightforward path from start to end. If there are 5 nodes, there would be 4 stages.

-The Above Information Describes a Shortest-Route Problem with the Distance