🔒 Pro members only
Breadth-first search
Traverse a graph using breadth-first-search to find a particular node. By traversing one layer at a time, we can make sure we've visited all the nodes!
This lesson is part of the members-only content of Computer science theory. The first 3 lessons of every course are free — this one starts after the free preview.
- ✓ Unlimited access to every lesson, video and article
- ✓ All subjects and age groups in one membership
- ✓ Cancel anytime · Visa & MasterCard accepted