New Lecture Series: Graph Algorithms in Depth

I have just completed uploading a new set of 6 lectures covering graph algorithms in depth — including Dijkstra's algorithm with proof of correctness, Bellman-Ford, Floyd-Warshall, Kruskal's and Prim's MST algorithms. These lectures are part of the Data Structures & Algorithms course but are also accessible to anyone interested in graph theory.