/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 vote232 views1 answer
C++ preprocessor commands
C++
5 votes196 views3 answers
Convert vector to set c++
C++
1 vote193 views2 answers
Cpp compare strings
C++
0 vote199 views1 answer
SET TO NULL pointer c++
C++
0 vote182 views2 answers
See Compilation Time in c++ Program
C++
-3 votes189 views1 answer
Cpp code for array sorting
C++
2 votes200 views1 answer
How to speed up cin and cout
C++
0 vote210 views1 answer
Sinh to hop c++
C++
1 vote230 views1 answer
Qlabel set text color
C++
-1 vote197 views1 answer
Ob for nginx.service failed because the control process exited with error code. See "systemctl status nginx.service" and "journalctl -xe" for details.
C++