Catalog Β· Introduction to Algorithms Lecture 18 of 47 Lecture 18: Speeding up Dijkstra β Previous Lecture 17: Bellman-Ford Next β Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths β Mark complete Materials Transcript (PDF) β transcript