fa26-cs577 cs577
Lecture 07: Breadth-First Search and Depth-First Search Lecture 07: Breadth-First Search and Depth-First Search
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 07: Breadth-First Search and Depth-First Search
Graph notation and search
Representations
Breadth-first search
Shortest paths and correctness
Runtime
Depth-first search
Edge classification
Runtime
Detecting cycles
Job scheduling and topological order
Reverse DFS finishing order
Why it works
Connections