hi
suppose that we have a adjacency list that represents a disconnected graph
I have a function that uses recursion in order to implement the DFS but it doesn't work when the graph is disconnected..
what's the best way to implement dfs on a disconnected graph?