{"id":25891,"date":"2017-10-25T21:13:05","date_gmt":"2017-10-25T15:43:05","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25891"},"modified":"2017-10-25T21:13:05","modified_gmt":"2017-10-25T15:43:05","slug":"java-algorithm-depth-first-traversal-dfs-graph","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-algorithm-depth-first-traversal-dfs-graph\/","title":{"rendered":"Java Algorithm – Depth First Traversal or DFS for a Graph"},"content":{"rendered":"

Depth First Traversal\u00a0for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. <\/span>
\nFor example, in the following graph, we start traversal from vertex 2. When we come to vertex 0, we look for all adjacent vertices of it. 2 is also an adjacent vertex of 0. If we don\u2019t mark visited vertices, then 2 will be processed again and it will become a non-terminating process. A Depth First Traversal of the following graph is 2, 0, 1, 3.<\/strong><\/p>\n

Java Programming:<\/strong><\/p>\n

<\/div> 
\/\/ Java program to print DFS traversal from a given given graphimport java.io.*;import java.util.*; \/\/ This class represents a directed graph using adjacency list\/\/ representationclass Graph{    private int V;   \/\/ No. of vertices     \/\/ Array  of lists for Adjacency List Representation    private LinkedList<Integer> adj[];     \/\/ Constructor    Graph(int v)    {        V = v;        adj = new LinkedList[v];        for (int i=0; i<v; ++i)            adj[i] = new LinkedList();    }     \/\/Function to add an edge into the graph    void addEdge(int v, int w)    {        adj[v].add(w);  \/\/ Add w to v's list.    }     \/\/ A function used by DFS    void DFSUtil(int v,boolean visited[])    {        \/\/ Mark the current node as visited and print it        visited[v] = true;        System.out.print(v+" ");         \/\/ Recur for all the vertices adjacent to this vertex        Iterator<Integer> i = adj[v].listIterator();        while (i.hasNext())        {            int n = i.next();            if (!visited[n])                DFSUtil(n, visited);        }    }     \/\/ The function to do DFS traversal. It uses recursive DFSUtil()    void DFS(int v)    {        \/\/ Mark all the vertices as not visited(set as        \/\/ false by default in java)        boolean visited[] = new boolean[V];         \/\/ Call the recursive helper function to print DFS traversal        DFSUtil(v, visited);    }     public static void main(String args[])    {        Graph g = new Graph(4);         g.addEdge(0, 1);        g.addEdge(0, 2);        g.addEdge(1, 2);        g.addEdge(2, 0);        g.addEdge(2, 3);        g.addEdge(3, 3);         System.out.println("Following is Depth First Traversal "+                           "(starting from vertex 2)");         g.DFS(2);    }}\/\/ This code is contributed by Aakash Hasija<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Following is Depth First Traversal (starting from vertex 2)\r\n2 0 1 3\r\n\r\n<\/pre>\n
Note that the above code traverses only the vertices reachable from a given source vertex. All the vertices may not be reachable from a given vertex (example Disconnected graph). To do complete DFS traversal of such graphs, we must call DFSUtil() for every vertex. Also, before calling DFSUtil(), we should check if it is already printed by some other call of DFSUtil(). Following implementation does the complete graph traversal even if the nodes are unreachable.<\/p>\n[ad type=”banner”]\n
The differences from the above code are highlighted in the below code.<\/p>\n
Java Programming:<\/strong><\/p>\n
<\/div>\n
 
 <\/div> 
\/\/ Java program to print DFS traversal from a given given graphimport java.io.*;import java.util.*; \/\/ This class represents a directed graph using adjacency list\/\/ representationclass Graph{    private int V;   \/\/ No. of vertices     \/\/ Array  of lists for Adjacency List Representation    private LinkedList<Integer> adj[];     \/\/ Constructor    Graph(int v)    {        V = v;        adj = new LinkedList[v];        for (int i=0; i<v; ++i)            adj[i] = new LinkedList();    }     \/\/Function to add an edge into the graph    void addEdge(int v, int w)    {        adj[v].add(w);  \/\/ Add w to v's list.    }     \/\/ A function used by DFS    void DFSUtil(int v,boolean visited[])    {        \/\/ Mark the current node as visited and print it        visited[v] = true;        System.out.print(v+" ");         \/\/ Recur for all the vertices adjacent to this vertex        Iterator<Integer> i = adj[v].listIterator();        while (i.hasNext())        {            int n = i.next();            if (!visited[n])                DFSUtil(n,visited);        }    }     \/\/ The function to do DFS traversal. It uses recursive DFSUtil()    void DFS()    {        \/\/ Mark all the vertices as not visited(set as        \/\/ false by default in java)        boolean visited[] = new boolean[V];         \/\/ Call the recursive helper function to print DFS traversal        \/\/ starting from all vertices one by one        for (int i=0; i<V; ++i)            if (visited[i] == false)                DFSUtil(i, visited);    }     public static void main(String args[])    {        Graph g = new Graph(4);         g.addEdge(0, 1);        g.addEdge(0, 2);        g.addEdge(1, 2);        g.addEdge(2, 0);        g.addEdge(2, 3);        g.addEdge(3, 3);         System.out.println("Following is Depth First Traversal");         g.DFS();    }}\/\/ This code is contributed by Aakash Hasija<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Following is Depth First Traversal\r\n0 1 2 3<\/pre>\n
Time Complexity: O(V+E) where V is number of vertices in the graph and E is number of edges in the graph.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Java Algorithm – Depth First Traversal or DFS for a Graph -Graph Algorithms -Depth First Traversal for a graph is similar to Depth First Traversal of a tree<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,74168,73906,2139],"tags":[75902,75906,75904,75905,75901,75900,75903,74286],"class_list":["post-25891","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-dfs-and-bfs","category-graph-algorithms","category-java","tag-bfs-java","tag-breadth-first-search","tag-depth-first-search-algorithm","tag-depth-first-search-c","tag-depth-first-search-java-stack","tag-depth-first-search-tree-java","tag-dfs-java-recursive","tag-graph-traversal-in-data-structure"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25891","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25891"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25891\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25891"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25891"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25891"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}