/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 vote141 views1 answer
Find largest number in each row in array c++ using function
C++
0 vote133 views1 answer
I2c slave onreceive
C++
5 votes128 views3 answers
Convert vector to set c++
C++
0 vote130 views1 answer
Constructor syntax in c++
C++
5 votes129 views2 answers
Time measurement c++
C++
0 vote128 views1 answer
Graph using queue c++
C++
-1 vote131 views1 answer
String array 2d c++
C++
12 votes132 views3 answers
Declare vector of size n in c++
C++
0 vote144 views1 answer
C++ vector push if not exist
C++
2 votes143 views2 answers
Onclick show hide div jquery demo
C++