Podcasts Technology Introduction to Algorithms (2011) Lecture 18: Speeding up Dijkstra

Lecture 18: Speeding up Dijkstra

Published: Dec. 7, 2012, 7:49 p.m.

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.