BFS, DFS & Connectivity

BFS shortest paths, DFS edge types, connected components, cycle detection, and bipartite checks.

0 / 5 solved

Question Tags Difficulty Success

Data Structures

Easy 70%

2. Two Rooms Seven Talks

bipartitetwo-coloring +2

Medium —

3. Marked Too Late

bfsvisited-marking +2

Medium —

4. Back Edge Or Cross

dfsback-edge +3

Medium —

5. Front Or Back

01-bfsdeque +2

Hard —

Learning Resources

cp-algorithms, Breadth-first search

cp-algorithms, Depth-first search

cp-algorithms, 0-1 BFS

Jeff Erickson, Depth-First Search chapter

USACO Guide, Graph Traversal

Up next

5 of 5 questions here are still unsolved.

Next module Topological Order & DAGs