Lecture 18: Speeding up Dijkstra

Name: Lecture 18: Speeding up Dijkstra
Uploaded: 2013-01-14T20:26:48Z
Duration: 53 min 16 s
Description: 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

53:16

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