Breadth-First Search

The Breadth-First Search is an iterative algorithm that finds if there is a path from one node to another.

Unlike Depth-First Search, it looks for the neighbours node first before going for the children.

The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.

Resources

https://en.wikipedia.org/wiki/Breadth-first_search