Depth First Search (DFS) and Breadth First Search (BFS) are two searching algorithms that traverse tree or graph data structures.

They are very similar in implementation and only differ in the choice of which node to visit next.