How breadth first traversal works?

1.	How breadth first traversal works?
Answer» Breadth First Search algorithm(BFS) traverses a graph in a breadthwards motion and uses a queue to remember to get the next vertex to start a search when a dead end occurs in any iteration.

Discussion