##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Pattern recognition
You have learned four graph techniques: BFS for shortest paths, DFS for exploration, cycle detection for dependencies, and DP on DAGs for paths.
In real problems, the hard part is recognizing which technique to use. This section gives you mixed problems where you decide.
By the end, you will recognize patterns fast and pick the right approach without overthinking.
