Depth First Algorithm in C++

AbhiTaker · AbhiTaker · commit 6b765683baa3 · 2017-10-05T20:53:04.000+05:30
diff --git a/DepthFirstSearch/C++/DFS(iterative).cpp b/DepthFirstSearch/C++/DFS(iterative).cpp
@@ -0,0 +1,52 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+vector<int> adj[1000];            //adjacency list of graph
+bool visited[1000]={false} ;               //array to keep track of visited nodes
+
+void bfs(int source)
+{
+    visited[source] = true;
+
+    queue<int> q;
+    q.push(source);
+
+    while(!q.empty())
+    {
+        source = q.front() ;
+        q.pop();
+
+        for(int i=0; i<adj[source].size() ;i++)      //visiting neighbours of source vertex
+        {
+            int neighbour = adj[source][i];
+            if( !visited[neighbour])
+               {
+                visited[neighbour] = true;
+                 q.push(neighbour);
+               }
+        }
+    }
+
+}
+
+int main()
+{
+    int vertices,edges;
+    cin>>vertices>>edges;
+
+    for(int i=0; i<edges ; i++)
+    {
+        int u,v;
+        cin>>u>>v;
+        adj[u].push_back(v);
+        adj[v].push_back(u);
+    }
+
+    int source;
+    cin>>source;
+
+    bfs(source);
+
+    return 0;
+}
