Computer Science Distilled: Learn the Art of Solving Computational Problems (Code is Awesome)

by Wladston Ferreira Filho

If going deep in the graph isn't a good approach, you can try Breadth First Search (BFS). It explores the graph level per level: first the neighbors of your start node, then its neighbors' neighbors, and so on.