Computer Science / Unit 3 CS 0151 short lesson, about 20 seconds
Breadth-First Search
Captions available
The idea
Breadth-first search traverses a graph level by level, exploring every neighbor before any neighbor's neighbor, visiting each vertex once in correct level order — cost likewise in O(V plus E).
In practice
A rumor spreading through a school reaches every direct friend before any friend-of-a-friend.
Where people slip
Level order is the promise depth-first never makes.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
- Nothing yet depends on this.
Something wrong in this lesson? Flag it · Sources for Computer Science