Breadth-first search (BFS)
A specialization of the generic search that
tests all vertices at one depth
before checking others at a greater depth.
A specialization of the generic search that
tests all vertices at one depth
before checking others at a greater depth.