DFS Jitu.java

Jitu.java

@@ -0,0 +1,68 @@
+import java.io.*;
+import java.util.*;
+
+
+class Graph {
+    private int V;
+
+    private LinkedList<Integer> adj[];
+
+    public Graph(int v)
+    {
+        V = v;
+        adj = new LinkedList[v];
+        for (int i = 0; i < v; ++i)
+{
+          adj[i] = new LinkedList();
+    	}
+
+    void addEdge(int v, int w)
+    {
+        adj[v].add(w);                             
+    }
+
+
+    void DFSUtil(int vertex, boolean nodes[])
+    {
+
+        nodes[vertex] = true;                         
+        System.out.print(vertex + " ");
+        int a = 0;
+
+        for (int i = 0; i < adj[vertex].size(); i++)  
+            {
+                a = adj[vertex].get(i);
+                if (!nodes[a])                    
+                {
+                    DFSUtil(a, nodes);
+                }
+            }  
+    }
+
+    void DFS(int v)
+    {
+        boolean already[] = new boolean[V];             
+        DFSUtil(v, already);
+    }
+
+    public static void main(String args[])
+    {
+        Graph g = new Graph(6);
+
+        g.addEdge(0, 1);
+        g.addEdge(0, 2);
+        g.addEdge(1, 0);
+        g.addEdge(1, 3);
+        g.addEdge(2, 0);
+        g.addEdge(2, 3);
+        g.addEdge(3, 4);
+        g.addEdge(3, 5);
+        g.addEdge(4, 3);
+        g.addEdge(5, 3);
+
+        System.out.println(
+            "Following is Depth First Traversal: ");
+
+        g.DFS(0);
+    }
+}