You've learned the core graph patterns. Number of Islands showed connected component counting: for each unvisited node, explore the entire component. Clone Graph demonstrated graph copying: use a hash map to track original → clone and avoid infinite loops. Course Schedule taught cycle detection: use three states (unvisited, visiting, visited) to detect back-edges. For graph problems, first identify: is it about connectivity? Shortest path? Cycles? Topological order? The answer guides your algorithm choice.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/graphs/section-recap
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████