/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

1 vote197 views1 answer
How to iterate throguh a string in c++
C++
0 vote189 views1 answer
C++ std map initializer list
C++
1 vote195 views1 answer
Multiply two numbers <=10^18 %m in cpp
C++
0 vote200 views1 answer
Bash find into array
C++
0 vote138 views1 answer
Scss variable is not defined
C++
0 vote212 views1 answer
Come concatenare stringhe in c++
C++
0 vote184 views1 answer
What c++ library is arccos in
C++
0 vote182 views1 answer
Input n space separated integers in c++
C++
7 votes270 views2 answers
Count number of char in a string c++
C++
4 votes181 views1 answer
How to make i/o fast in c++
C++