/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 vote261 views1 answer
How to read a line from the console in c++
C++
35 votes239 views3 answers
How to write hello world in c++
C++
1 vote232 views1 answer
Fibonacci series in c++ Recursive
C++
0 vote242 views1 answer
C++ start process and get output
C++
0 vote211 views1 answer
I2c slave onreceive
C++
1 vote229 views1 answer
Gl draw line rectangle
C++
0 vote253 views1 answer
Ternary operator rsut
C++
0 vote206 views1 answer
Idnefier endl in undefince
C++
0 vote219 views1 answer
How to declare a 2d boolean vector in c++
C++
4 votes206 views2 answers
C++ cin operator
C++