breadth-first search in Finnish

(graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.