/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

6 votes145 views1 answer
C++ estimate deciimal to a point
C++
0 vote145 views1 answer
Full implementation of binary search tree in C++
C++
7 votes498 views5 answers
Stoi cpp
C++
5 votes159 views1 answer
All library in c++
C++
2 votes151 views2 answers
Cpp split string by space
C++
0 vote153 views2 answers
Read a file line by line c++ struct site:stackoverflow.com
C++
0 vote161 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
0 vote161 views3 answers
Options select from array
C++
0 vote157 views6 answers
Gcd
C++
1 vote152 views1 answer
Swap using Function template in c++
C++