/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

7 votes219 views1 answer
Venge io
C++
0 vote187 views1 answer
Glew32.dll was not found
C++
1 vote187 views2 answers
Convert from hex to decimal c++
C++
0 vote189 views1 answer
Mkdir boost filesystem
C++
1 vote177 views1 answer
Merge images opencv c++
C++
1 vote159 views1 answer
Prints all the keys and values in a map c++
C++
0 vote170 views1 answer
Why constructor can't be static in c++
C++
1 vote215 views1 answer
Remove () not working c++
C++
0 vote176 views1 answer
How can I delete a substring from a string in c++?
C++
2 votes165 views1 answer
Endl in c++ means
C++