Here is the sub-topic-wise arrangement of the graph problems you provided.
Graph Traversal (BFS / DFS)
This section covers fundamental traversal algorithms, including searching on grids, checking
connectivity, finding cycles, and exploring state spaces.
Grid & General Traversal
o Counting Rooms (CSES)
o Number of Islands (LeetCode)
o Surrounded Regions (LeetCode)
o Labyrinth (CSES)
o Message Route (CSES)
o Monsters (CSES)
o Maze (Codeforces)
o Minesweeper (Codeforces)
o Valid BFS? (Codeforces)
o .. (Double Dots) (AtCoder)
o Ladder (AtCoder)
o Belt Conveyor (AtCoder)
Connectivity & Bipartite Graphs
o Building Teams (CSES)
o Graph Without Long Directed Paths (Codeforces)
o Beautiful Graph (Codeforces)
o Cthulhu (Codeforces)
Cycle Detection
o Round Trip (CSES)
o Round Trip II (CSES)
o Round Trip (AtCoder)
o Takahashi's Secret (AtCoder)
o Subway (Codeforces)
o Mouse Hunt (Codeforces)
State-Space Search & Puzzles
o 8 Puzzle (AtCoder)
o Multiply and Rotate (AtCoder)
o "atcoder" (AtCoder)
Topological Sort & DP on DAGs
o Course Schedule (CSES)
o Longest Flight Route (CSES)
o Game Routes (CSES)
o Martial artist (AtCoder)
Disjoint Set Union (DSU)
Problems primarily solved by tracking connected components efficiently.
Building Roads (CSES)
Road Construction (CSES)
Connect Cities (AtCoder)
Friends (AtCoder)
KAIBUNsyo (AtCoder)
Cow and Snacks (Codeforces)
Peaceful Rooks (Codeforces)
Shortest Paths
Algorithms for finding the minimum cost path in weighted and unweighted graphs.
Dijkstra's Algorithm
o Shortest Routes I (CSES)
o Flight Discount (CSES)
o Investigation (CSES)
o Flight Itinerary (CSES)
o Number of Shortest paths (AtCoder)
Bellman-Ford & Floyd-Warshall
o Shortest Routes II (CSES)
o High-Score (CSES)
o Cycle Finding (CSES)
Trees
Problems on the specific graph structure of trees, from basic properties to advanced
techniques.
Basic Traversal & Properties
o Subordinates (CSES)
o Tree Diameter (CSES)
o Tree Distances I (CSES)
o Tree Distances II (CSES)
o Tree Matching (CSES)
o Annoying Present (Codeforces)
o Takahashi Tour (AtCoder)
o Range Reachability (AtCoder)
o Unique Color (AtCoder)
o Ameba (AtCoder)
o War-games (AtCoder)
LCA & Binary Lifting
o Company Queries I (CSES)
o Company Queries II (CSES)
o Distance Queries (CSES)
o Planets Queries I (CSES)
o Planets Queries II (CSES)
Advanced Tree Algorithms
o Subtree Queries (CSES)
o Path Queries (CSES)
o Path Queries II (CSES)
o Distinct Colors (CSES)
o Finding a Centroid (CSES)
o Fixed-Length Paths I (CSES)
o Fixed-Length Paths II (CSES)
Strongly Connected Components (SCC)
Problems on directed graphs that involve finding strongly connected subgraphs.
Flight Route Check (CSES)
Planets and Kingdoms (CSES)
Coin Collector (CSES)
Giant Pizza (CSES)
Eulerian Paths & Circuits
Finding a trail in a graph that visits every edge exactly once.
Mail Delivery (CSES)
Teleporters Tour (CSES)
De Bruijn Sequence (CSES)
Maximum Flow & Minimum Cut
Problems involving network flow models.
Police Chase (CSES)
Download Speed (CSES)
Distinct Routes (CSES)
Backtracking & Ad-hoc
Problems requiring recursive exploration of all possibilities, which can often be viewed as a
traversal on an implicit graph.
Bridge (AtCoder)
Knight's Tour (CSES)
Hamiltonian Flights (CSES)
Count Simple Paths (AtCoder)
Make Takahashi Happy (AtCoder)
Product of Bags (AtCoder)
Dance (AtCoder)
Unique Username (AtCoder)
