breadth-first traversal
Description: A graph or tree traversal method that visits nodes in order of their distance from a starting node, processing neighboring levels successively.
Wikidata ID: wiki/Q325904
OpenAlex ID: keywords/breadth-first-traversal
