Presentations

Recitations

Number Date Topics Presentation
1 Eulerian cycles and paths PPT PDF
2 Bipartite graphs and BFS PPT PDF
3 DFS, SCCs, and bi-connectivity PPT PDF
4 MST's, Prim and Kruskal PPT PDF
5 Dynamic programming PPT PDF
6 Bellman Ford PPT PDF
7 Dijkstra PPT PDF
8 All pairs shortest paths PPT PDF
9 Linear Programming 1 PPT PDF
10 Linear Programming 2 PPT PDF
11 Flow, Menger's Theorem, Connectivity PPT PDF
12 Flow II, Matching, k-Connectivity PPT PDF
13 Flow III, Hall's Theorem PPT PDF

The PDF files are here to overcome Powerpoint issues. They are not recommended, as the animations (which only work in Powerpoint) are usually a major part of the presentation.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License