Post date: Apr 02, 2018 4:25:29 PM
Topic: Dynamic Programming: All-pairs shortest paths
Lecture notes: PDF, PDF, CLRS 25 (For a review of single source shortest paths, e.g. Dijkstra and Bellman-Ford, see CLRS 24 and Unit 6 of 6.006)
Videos: URL
Problem Set 5: PDF (Hashing, Augmentation, Dynamic Programming, answers due April 5 in class, grading due April 17 in class)