/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 vote184 views1 answer
C++ pointer to vector
C++
1 vote169 views1 answer
Find largest number in vector c++
C++
0 vote165 views1 answer
Iterate const vector
C++
-1 vote185 views1 answer
How to parse using stringstream
C++
0 vote171 views1 answer
Play sound opencv video c++
C++
0 vote172 views1 answer
C++ conditional typedef
C++
0 vote183 views1 answer
Fstream read write mode
C++
0 vote165 views1 answer
How to move your chrector in unity
C++
0 vote166 views1 answer
C++ read_ascii
C++
0 vote170 views1 answer
My cpp
C++