Data structures & algorithms

What is Breadth-first search?

Also called: BFS

Breadth-first search explores a graph level by level using a queue, visiting all neighbours of a node before moving further away. In an unweighted graph it finds the shortest path in terms of number of edges.