/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 vote192 views1 answer
Dynamic 2d array c++
C++
0 vote248 views1 answer
Read large files part by part in C++
C++
0 vote255 views1 answer
How to change the type of something in c++
C++
29 votes234 views2 answers
C program runner
C++
0 vote243 views1 answer
Surf interpolation matlab
C++
5 votes226 views1 answer
Cpp all in one header
C++
-2 votes248 views2 answers
C++ for
C++
1 vote234 views2 answers
Struct constructor in c++
C++
4 votes239 views1 answer
Appending a double to a string c++
C++
0 vote251 views1 answer
What is handling null terminated string in c++
C++