Breadth-First Search
/bredθ fɜːst sɜːtʃ/
Definition
A graph traversal visiting all neighbours at the current depth before moving deeper — uses a queue.
Example in context
"BFS finds the shortest path in an unweighted graph — each level of the queue is one step further from the source."
Related terms
Practice this term
Master Breadth-First Search in context by working through exercises in the Data Structures & Algorithms module. You'll see the term used in real engineering scenarios with multiple-choice, fill-in-the-blank, and matching drills.