F2021 CS 340 Lecture 27 (Single-Source Shortest Paths, Dijkstra's Algorithm)

IMPORTANT: For some strange reason I wrote Dijskstra on the board, it's actually spelled Dijkstra. I don't know why I did this, I've taught this algorithm numerous times; my apologies!
Today we talked about how we can compute shortest paths!

Time Stamps:
0:00 Opening
1:07 Single-Source Shortest Path Problem (Terminology, Properties, Problem)
13:50 Dijkstra's Algorithm
41:56 Example of applying Dijkstra's Algorithm