drogba111 0 Newbie Poster

Hi there , basically i need to find connected components in graph using deep first search. i have already implemented the DFS method but unable to think how am i supposed to print out which is the connected components. is there any hint in implementing it using dfs?tips or pseudo will do great.thanks