Merge pull request #376 from sonalimahajan12/sonali

Recursive DFS in CPP

Author: probot-auto-merge[bot]

Graph Traversal/DFS/dfs_recursive.cpp

@@ -0,0 +1,52 @@
+    #include <iostream>
+    #include <list>
+    using namespace std;
+     
+    class Graph
+    {
+        int numVertices;
+        list *adjLists;
+        bool *visited;
+        
+    public:
+        Graph(int V);
+        void addEdge(int src, int dest);
+        void DFS(int vertex);
+    };
+     
+    Graph::Graph(int vertices)
+    {
+        numVertices = vertices;
+        adjLists = new list[vertices];
+        visited = new bool[vertices];
+    }
+     
+    void Graph::addEdge(int src, int dest)
+    {
+        adjLists[src].push_front(dest);
+    }
+     
+    void Graph::DFS(int vertex)
+    {
+        visited[vertex] = true;
+        list adjList = adjLists[vertex];
+        
+        cout << vertex << " ";
+     
+        list::iterator i;
+        for(i = adjList.begin(); i != adjList.end(); ++i)
+            if(!visited[*i])
+                DFS(*i);
+    }
+     
+    int main()
+    {
+        Graph g(4);
+        g.addEdge(0, 1);
+        g.addEdge(0, 2);
+        g.addEdge(1, 2);
+        g.addEdge(2, 3);
+        g.DFS(2);
+     
+        return 0;
+    }