Depth First Search, Recursive with Cycle Detection

DFS, recursive with cycle detection

vector<int> adjList[N];
int visited[N];

bool dfsrecursiveandcycle(int u, int parent)
{
    cout << "visited " << u << endl;// :-)
    visited[u] = 1;
    bool ans = false;
    for(int i=0;i<adjList[u].size();i++)
    {
        if(!visited[adjList[u][i]])
        {
            if(dfsrecursiveandcycle(adjList[u][i], u)) ans = true;
        }
        else if(adjList[u][i]!=parent)
        {
            ans = true;
        }
        
    }
    return ans;
}