Breadth first search
a.k.a. BFS
A graph traversal pattern which looks at all nodes connected to the current node simultaneously while exploring.
A graph traversal pattern which looks at all nodes connected to the current node simultaneously while exploring.