Core Traversal Algorithms: BFS & DFS

Implement Depth-First Search (DFS) recursively to explore a graph.

Implement Breadth-First Search (BFS) iteratively using a queue.

Prove that BFS finds the shortest path in terms of number of edges in an unweighted graph.

Use DFS to find all connected components in an undirected graph.

Detect cycles in both undirected and directed graphs using DFS.

Model a 2D grid as an implicit graph to solve traversal problems like shortest path or flood fill.

Determine if a graph is bipartite by attempting a 2-coloring during a traversal (BFS or DFS).