6.046J | Spring 2015 | Undergraduate
Design and Analysis of Algorithms
Lecture Videos

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Description: In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem.

Instructors: Erik Demaine

Lecture Notes
Notes for Lecture 11 (PDF) are available.
Learning Resource Types
theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
notes Lecture Notes
co_present Instructor Insights