Introduction to Algorithms: Speeding up Dijkstra

Speeding up Dijkstra

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.