/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

0 vote341 views1 answer
Iff
C++
0 vote310 views1 answer
Equals operator c++ overlaod
C++
14 votes328 views4 answers
Converting to string c++
C++
16 votes338 views3 answers
Console clear c+
C++
2 votes326 views1 answer
Web scraping with cpp
C++
5 votes336 views2 answers
Time measurement c++
C++
0 vote331 views1 answer
Inconsequential meaning
C++
0 vote290 views1 answer
C++ while loop decrement
C++
0 vote362 views1 answer
C++ add to array
C++
1 vote316 views1 answer
C++ call method in same class
C++