Dynammic Programming Search

Question 1

What is the dynamic programming search (description)?

Answer 1

Build a table dist(n) storing shortest path from node n to goal.

Question 2

What is the bellman ford equation for dynammic programming graph search?

Answer 2