-
Camp materials:
-
Discussed topics (with further reading resources):
- Breadth-first search (BFS)
- Depth First Search (DFS)
- 0-1 BFS (Additional Resource)
- Dijkstra Algorithm
- Shortest Path Faster Algorithm (SPFA) (Additional Resource)
- Floyd–Warshall (Additional Resource)
- Articulation Point
- Articulation Bridge
- Biconnected Component (BCC)
- Block-Cut Tree (Additional Resource)
- Strongly Connected Components (SCC) (Additional Resource)
- 2 – SAT (Additional Resource)
-
Additional Reading for Graph Theory:
-
Discussed problems
-
Practice problems: