/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

2 votes354 views1 answer
++x vs x++
C++
23 votes303 views6 answers
String to char
C++
1 vote306 views3 answers
C++ if example
C++
13 votes304 views4 answers
Stl sort in c++
C++
0 vote350 views2 answers
How to write String in C++
C++
0 vote301 views1 answer
What is push() c++
C++
1 vote282 views1 answer
How to add colored text in c++
C++
0 vote302 views1 answer
C++ qt QFuture
C++
0 vote315 views1 answer
Lexene token pairs of java codes
C++
-1 vote305 views1 answer
How to make sound in c++
C++