juniorGraph Theory
Explain Breadth-First Search (BFS).
Updated Apr 28, 2026
Short answer
A traversal algorithm that explores all neighbors at the current depth before moving to the next level.
Deep explanation
Graphs are versatile structures for representing networks. A traversal algorithm that explores all neighbors at the current depth before moving to the next level. Adjacency matrices are O(1) for edge lookups but O(V^2) space, while lists are more space-efficient for sparse graphs.
Real-world example
Social media networks (friends/followers).
Common mistakes
- Using an Adjacency Matrix for a very sparse graph with millions of nodes.
Follow-up questions
- Space complexity of Adjacency List?