Breadth-first search

A traversal that visits vertices in increasing edge distance from a chosen start.

Also known as BFS, breadth-first traversal, 广搜, 广度优先遍历