In this roadmap, I'll teach you the patterns behind advanced graph problems. Shortest path variants, grid traversals, connectivity with DSU and DFS, DAG processing, tree algorithms, and centroid decomposition. Each section gives you a pattern, then does a walkthrough over problems so that you fully understand how they apply.
We are going to solve problems from credible judges like LeetCode, Codeforces, and CSES.
By the end, you'll get a better intuition about how graph problems can be solved, you can recognize the patterns after reading a problem statement.
