/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 vote89 views1 answer
Visual studio cpp compiler
C++
0 vote122 views1 answer
Find a number in vector c++
C++
0 vote89 views1 answer
How can I replace a pattern from string in c++
C++
1 vote92 views1 answer
Ue4 find component c++
C++
1 vote99 views4 answers
Return function in cpp
C++
0 vote97 views1 answer
Remove a element from an array c++
C++
0 vote91 views2 answers
Read a file line by line c++ struct site:stackoverflow.com
C++
1 vote96 views1 answer
Factore of 20 in c+
C++
1 vote96 views1 answer
C++ isalphanum
C++
20 votes103 views4 answers
Cin getline
C++