In graph navigation algorithms, we have two different strategies for visiting each node. The first one is Depth-First Search (DFS) and the second one is Breadth-First Search
