breadth-first search
A graph traversal algorithm that explores all neighbor nodes at the present depth before moving on to nodes at the next depth level. Used in computing and algorithm contexts.
Breadth-first search is often used for shortest path problems.
Applying breadth-first search to this graph determines the order of visits.
Depth-first search explores as far as possible along each branch before backtracking, while breadth-first search explores level by level.
Compound of 幅 (breadth), 優先 (priority), and 探索 (search), directly translating the English term 'breadth-first search'.