Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
them in a same way we did earlier. Whoa, that is a lot of words to be honest !😅. Maybe we will look at an illustration to get a better intuition, DFS in action First we randomly select a vertex, here it is ‘1’ and we look at 1’s neighbors which are ‘2’ and ‘6’ . Then we choose to visit ‘2’ first,