# C++ Program to detect a cycle in Directed Graph

C++ Program to detect a cycle in directed graph is given below. Approach is simple, we will do DFS traversal of graph from each vertex (which will be source) and look if there is any back edge to the source during traversal. If there is any back edge then it means there is cycle in  the graph otherwise there is not any cycle.

ALGORITHM

```#include <list>
#include <stack>
#include <iostream>
#define V 6
using namespace std;

class detectCycle_DirectedGraph{

public:
void get_data();
bool isCyclic();

};
void detectCycle_DirectedGraph::get_data()
{

/* Let there are 6 vertices total from 1 to 6
and given edges are
1--->2
1--->4
2--->3
3--->1
3--->6
6--->5
5--->4

*/

}
bool detectCycle_DirectedGraph::isCyclic()
{
bool visited[V];
std::stack<int> s;
std::list<int>::iterator it;
for(int i=1;i<=V;i++)
{
for(int j=0;j<V;j++)
{
visited[j]=false;
}
visited[i]=true;
s.push(i);
int flag=0;
while(!s.empty())
{
int source=s.top();
s.pop();
{
if(*it==i)
{
/*If the traversing node is equal to current source vertex
which means there is a cycle */

return true;
}
if(visited[*it]==false)
{
s.push(*it);
visited[*it]=true;
}
}

}
}

/* If we don't find any cycle during traversal then return false*/
return false;
}

int main()
{
detectCycle_DirectedGraph graph;
graph.get_data();
if(graph.isCyclic())
{
cout<<"\n\nYes There is cycle in graph\n\n";
}
else
{
cout<<"\n\nThere is not any cycle in graph\n\n";
}
}```

OUTPUT