Lecture 32

Shortest Path Problem

Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Graph Search Problem: Modify the Goal
  2. Modified Search Problem: Find Path
  3. Modified Search Problem: Find Distance
  4. Modified Search Problem: Directed Graph
  5. Shortest Path: Unweighted Graph
  6. Shortest Path: Weighted Graph
  7. Shortest Path: Dijkstra's Algorithm
  8. Dijkstra's Algorithm: Exercise
  9. Dijkstra's Algorithm: Analysis
  10. Shortest Path: Summary

Lessons marked with ⚡ contain exercise/activity.