Courses/Algorithms (CS610 @IITGN)/Shortest Paths III/
8 Sep, 2021

8 Sep, 2021

Courses βΈ± Algorithms
You can also access the quiz on Itempool here if you want to practice, or see the notes below for more context. There were no questions on itempool in this class.

Lecture Recording

In-class Quiz Questions

πŸ“
We discussed situations in which Dijkstra does/doesn't work. One of the highlights was the observation that if you have negative weights and are looking for the shortest SIMPLE path, then you effectively are solving the LONG PATH problem! This class set the ground for Bellman-Ford, which was the topic of the next lecture.