/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 votes157 views1 answer
C++ switch string
C++
35 votes153 views6 answers
Hello world cpp
C++
0 vote167 views1 answer
Circular array
C++
1 vote139 views2 answers
C++ last element of array
C++
0 vote142 views2 answers
Opencv combine video
C++
19 votes134 views2 answers
C++ rewrite file
C++
0 vote135 views1 answer
C++ void to avoid functions
C++
0 vote139 views1 answer
Calculating Function codeforces in c++
C++
0 vote132 views1 answer
Why we use iostream in C++ programming
C++
1 vote148 views2 answers
Scope resolution operator in c++
C++