Graph Algorithms Roadmap

BFS, DFS, Union-Find, topological sort, and shortest paths for interviews.

1. 1.BFS & DFS

   Number of Islands, Clone Graph, Course Schedule

   queue bfsdfs backtracking

   #	Title	Difficulty	Topics
   200	Number of Islands	Medium	depth first search
   133	Clone Graph	Medium	breadth first search
   207	Course Schedule	Medium	breadth first search

2. 2.Union-Find & connectivity

   Redundant Connection style connectivity problems

   union find

   #	Title	Difficulty	Topics
   200	Number of Islands	Medium	depth first search
   305	Number of Islands II	Hard	hash table
   323	Number of Connected Components in an Undirected Graph	Medium	hash table
   399	Evaluate Division	Medium	graph
   547	Friend Circles	Medium	depth first search
   684	Redundant Connection	Medium	tree
   685	Redundant Connection II	Hard	tree
   721	Accounts Merge	Medium	hash table

3. 3.Advanced

   Word Ladder, Cheapest Flights, critical edges

   #	Title	Difficulty	Topics
   127	Word Ladder	Medium	breadth first search
   787	Cheapest Flights Within K Stops	Medium	breadth first search