DFS - Cycle Detection in Directed Graph

bool findLoop(int v) 
{
	if(vis[v]==1)
		return 1;
	if(vis[v]==2)
		return 0;
	vis[v]=1;
	for(auto &it:g[v])
	{
		if(findLoop2(it))
			return 1;
	}
	vis[v]=2;
	return 0;
}

bool checkLoop()
{
	fill(vis+1, vis+n+1, 0);
	for(int i=1;i<=n;i++)
	{
		if(!vis[i] && findLoop2(i, forb))
			return 0;
	}
	return 1;
}

//Problem 1 (Marking edges belong to a cycle): https://codeforces.com/contest/915/problem/D
//Solution 1: https://codeforces.com/contest/915/submission/41311663