You have practiced pattern recognition across six problems. You can now:
Identify when to use BFS vs DFS vs cycle detection vs DP on DAG
Handle multi-source BFS and grid shortest paths
Detect cycles in directed and undirected graphs
Solve longest path problems on DAGs
Next section covers tree algorithms, a special case of graphs where the tree structure gives you more tools and constraints that simplify many problems.