Cycle Detection in Directed Graph

#include <bits/stdc++.h>
using namespace std;

bool cycle(int src, vector<int> &stack, vector<bool> &visited, vector<vector<int>> &adjc_list)
{
    stack[src] = true;
    if (!visited[src])
    {
        visited[src] = true;
        for (auto i: adjc_list[src])
        {
            if (!visited[i] and cycle(i, stack, visited, adjc_list))
            {
                return true;
            }
            if (stack[i])
            {
                return true;
            }
        }
    }
    stack[src] = false;
    return false;
}

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> adjc_list(n);
    for (int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y; //x-->y
        adjc_list[x].push_back(y);
    }
    vector<int> stack(n, 0);
    vector<bool> visited(n, false);
    bool cycle_test = false;
    for (int i = 0; i < n; i++)
    {
        if (!visited[i] && cycle(i, stack, visited, adjc_list))
        {
            cycle_test = true;
        }
    }
    if (cycle_test)
    {
        cout << "cycle is present";
    }
    else
    {
        cout << "Not present";
    }

    return 0;
}