Graph – Depth First Search in Disconnected Graph

Objective: Given a Graph in which one or more vertices are disconnected, do the depth first traversal.

Earlier we have seen DFS where all the vertices in graph were connected. In this article we will see how to do DFS if graph is disconnected.



  • We will modify the DFS approach used here.
  • Maintain a visited [] to keep track of already visited vertices to avoid loops.
  • Iterate through all the vertices and for each vertex, make a recursive call to all the vertices which can be visited from the source and in recursive call, all these vertices will act a source.
  • See the code for more understanding.

Time Complexity: O(V+E) V – no of vertices E – no of edges



Depth-First Search:

0 4 5 6 1 3 2

Top Companies Interview Questions..-

Google Microsoft Amazon Facebook more..

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

You may also like...

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: