week3

Third Week Activities

    1. Topics

        • Graphs

        • Depth-first search

        • Strongly connected components

        • Breadth-first search

        • Directed acyclic graphs

        • Shortest paths (Dijkstra's and Bellman-Ford algorithms)

    2. Readings

        • Chapter 3 and 4 of Dasgupta, Papadimitriou and Vazirani