/C++/Detect cycle in an undirected graph

Detect cycle in an undirected graph

//function snippet using DFS
bool dfs(int node,int parent, vector<int> adj[], vector<bool> &check)
    {
        check[node] = true;
        for(auto n1 :adj[node])
        {
            if(!check[n1])
                if(dfs(n1, node, adj, check)) return true;
            else if(n1 != parent) return true;
        }
        return false;
    }
    
    bool isCycle(int V, vector<int> adj[]) {
        vector<bool>check(V, 0);
        //for all the commponents 
        for(int i =0; i < V; i++)
        {
            if(!check[i])
                if (dfs(i, -1, adj, check)) return true;// if a component has a cycle then graph has a cycle 
        }
        return false;
    }

Similar codes

1 vote193 views2 answers
Find the Missing Number
C++
1 vote139 views1 answer
Get first element of tuple c++
C++
1 vote159 views1 answer
Priority queue ordered by second element
C++
0 vote160 views1 answer
What is stdarg.h used for
C++
0 vote140 views1 answer
Vermífugo significado
C++
0 vote141 views1 answer
C++ erase remove
C++
0 vote150 views1 answer
C++ sort
C++
0 vote136 views2 answers
Css window id
C++
7 votes163 views3 answers
Setprecision in c++
C++
0 vote139 views1 answer
Who made c++
C++