Breadth-first search (BFS)

Breadth-first search (BFS) it's an algorithm for searching in a tree structure, it's useful for graph problems like what is shortest path between city A and city F or finding the shortest path to reach the exit for a maze.More info on wikipedia Hones...