Lecture Videos
Lecture 16: Dijkstra
Description: This lecture shows how to find shortest paths in directed acyclic graphs (DAGs) using topological sort, and in graphs without negative edges using Dijkstra’s algorithm.
Instructor: Srini Devadas
Course Info
Instructors
Departments
As Taught In
Fall
2011
Level
Course Info
Instructors
Departments
As Taught In
Fall
2011
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
theaters
Problem-solving Videos
assignment_turned_in
Programming Assignments with Examples
