breadth-first search

Short definition from Wiktionary

Noun

A search algorithm that begins at the root node and explores all the neighboring nodes.

We haven’t written up breadth-first search yet: Simple and Standard meanings, examples and a quiz.