Third Week Activities
- Topics
- Graphs
- Depth-first search
- Strongly connected components
- Breadth-first search
- Directed acyclic graphs
- Shortest paths (Dijkstra's and Bellman-Ford algorithms)
- Readings
- Chapter 3 and 4 of Dasgupta, Papadimitriou and Vazirani
|
|