6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 18: Shortest Paths IV - Speeding up Dijkstra

Description:

Lecture notes on shortest paths, single-source single-target Dijkstra, bidirectional search, and goal directed search - potentials and landmarks.

Resource Type:
Lecture Notes
pdf
1 MB
Lecture 18: Shortest Paths IV - Speeding up Dijkstra
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples