Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
and now instead of visiting the next neighbor of ‘1’ which is ‘6’, we go onto visit 2’s neighbors which are ‘3’ and ‘5’, in the process of visiting ‘3’ we decide to visit 3’s neighbor too. I hope that explains the recursive strategy of DFS to visit vertices on a graph. Moral: Don’t get too obsessed