6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 18: Speeding up Dijkstra

Description: This lecture covers optimizations that can improve real-life, average case performance of shortest path algorithms. These include using Dijkstra for a single source and single target, bi-directional search, and goal-directed or A* search.

Instructor: Srini Devadas

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes