Lecture 17: Dynamic Programming

Lecture 17 covered the dynamic programming chapter Links to an external site. of the book.  The associated Homework 13 asks you to use dynamic programming to compute the shortest path from each vertex to a goal vertex in a graph. 

These are the handwritten notes Links to an external site. used in class. 

Video of the lecture: