Dynamic programming,when used for the shortest-route problem,requires complete enumeration of paths from the beginning to ending node.

Name: Dynamic programming,when used for the shortest-route problem,requires complete enumeration of paths from the beginning to ending node.
Brand: Quizplus
Rating: 4.9 (39 reviews)

Question

Quizplus · Accepted Answer

Dynamic programming for the shortest-route problem does not require complete enumeration of paths, instead it uses a recursive approach to solve subproblems and build up the solution.

Dynamic Programming,when Used for the Shortest-Route Problem,requires Complete Enumeration of Paths