Lectures

Lecture 1 - Glossary

Lecture 2 - Representation

Lecture 3 - BFS, DFS, Tarjan

Lecture 4 - Dijkstra, A*, Ford, Floyd-Warshall, DP, Matrix multiplication algorithms

Lecture 5 - DAGs, Topological Sorting, Tarjan (DFS), Predecessor counters, Scheduling problem

Lecture 6 - Trees, Minimum Spanning Tree - Kruskal, Prim algorithm ✅

Lecture 4 - Dijkstra, A*, Ford, Floyd-Warshall, DP, matrix multiplication algorithms

Lecture 5 - Minimum cost walk between all pairs of vertices

Lecture 6 - Directed acyclic graphs (DAGs)

Seminars

Seminar 1 - Modelling real problems with graphs

Seminar 2 - Methods of representing a graph

Seminar 3 - Breadth-first and depth-first search (python)