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

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