diff --git a/Cycle_Detection_Graphs/dfs_directed_cycle.cpp b/Cycle_Detection_Graphs/dfs_directed_cycle.cpp
new file mode 100644
index 0000000000..9cfd59ace7
--- /dev/null
+++ b/Cycle_Detection_Graphs/dfs_directed_cycle.cpp
@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+using namespace std;
+int N=4;
+vector<int> vis(5);
+vector<vector<int> > G(N+1);
+bool temp;
+bool dfs(int root){
+	vis[root]=1;
+	for(int i=0;i<G[root].size();i++){
+		if(vis[G[root][i]]==0)
+		  temp=dfs(G[root][i]);
+		else if(vis[G[root][i]]==1)
+		   return 1;
+		if(temp)
+		   return 1;   
+	}
+	vis[root]=2;
+	return 0;
+}
+int main(){
+	G[1].push_back(2);
+	G[1].push_back(3);
+	G[2].push_back(3);
+	G[3].push_back(4);
+	G[4].push_back(1);
+	vector<bool> v;
+	for(int i=1;i<=N;i++){
+		if(!vis[i]){
+			v.push_back(dfs(i));
+		}
+	}
+	int i;
+	for(i=0;i<v.size();i++){
+		if(v[i]){
+			cout<<"cycle exists"<<endl;
+			break;
+		}
+	}
+	if(i==v.size())
+	  cout<<"cycle does not exist"<<endl;
+}
diff --git a/Cycle_Detection_Graphs/dfs_undirected_cycle.cpp b/Cycle_Detection_Graphs/dfs_undirected_cycle.cpp
new file mode 100644
index 0000000000..f6ebcfa910
--- /dev/null
+++ b/Cycle_Detection_Graphs/dfs_undirected_cycle.cpp
@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+int N=6;
+vector<bool> vis(N+1);
+vector<vector<int> > G(N+1);
+bool dfs(int root,int p){
+	vis[root]=1;
+	bool temp=false;
+	for(int i=0;i<G[root].size();i++){
+		if(G[root][i]==p)
+		  continue;
+		if(vis[G[root][i]]){
+			return 1;
+		}  
+		else{
+			temp=(temp||dfs(G[root][i],root));
+		}
+	}
+	return temp;
+}
+int main(){
+	G[1].push_back(2);
+	G[2].push_back(3);
+	G[2].push_back(1);
+	G[2].push_back(6);
+	G[3].push_back(4);
+	G[3].push_back(5);
+	G[3].push_back(2);
+	G[4].push_back(3);
+	G[5].push_back(3);
+	G[5].push_back(6);
+	G[6].push_back(2);
+	G[6].push_back(5);
+	if(dfs(1,-1))
+			cout<<"cycle exists"<<endl;
+	else
+	  cout<<"cycle does not exist"<<endl;
+}
+	
+