Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
recursively until there are no neighboring nodes for a particular node, while doing so, we maintain an array to check if the particular adjacent vertex is visited or not, this is to avoid visiting the same node more than once. Then we backtrack and check for other unmarked vertices and traverse