2 votes
Accepted

Why do exhaustive search require 14 travel segment evaluations but dynamic programming require 10 for this shortest path problem?

Like it's explained in the image's caption, DP techniques are based on the idea that you can reuse the solution to subproblems, so it assumes that you can break down the original problem into ...
nbro's user avatar
  • 40.5k
2 votes

Why do exhaustive search require 14 travel segment evaluations but dynamic programming require 10 for this shortest path problem?

Exhaustive search is just trial and error for the specified problem which has a fixed start node X and a fixed end node Y, thus every possible travel route from X to Y has to be evaluated ...
cinch's user avatar
  • 2,307

Only top scored, non community-wiki answers of a minimum length are eligible