You'll work through sections, each focused on a different graph pattern:
Shortest Path Variants for state-space extensions
Grid Graphs for 2D traversal problems
Connectivity with DSU and DFS for components and bridges
DAG and Topological Sort for scheduling problems
Tree Algorithms for rerooting and path queries
Centroid Decomposition for divide-and-conquer on trees
Each section starts with the pattern, then gives you problems. You should first try to solve them yourself, and then look at the step by step solution that I explain.
