/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 vote283 views3 answers
Reverse string c++
C++
0 vote268 views1 answer
Cpp pass function with input to thread
C++
0 vote243 views1 answer
Redragon m609 weight
C++
-1 vote272 views1 answer
Error: Microsoft Visual C++ 14.0 is required. Get it with "Build Tools for Visual Studio": https://visualstudio.microsoft.com/downloads/
C++
0 vote256 views1 answer
Str[i] - '0'
C++
0 vote268 views1 answer
C++ remove all elements equal to
C++
0 vote280 views1 answer
Auto keyword
C++
0 vote250 views1 answer
What algorithm does bitcoin use
C++
0 vote256 views1 answer
Makefile for single cpp file
C++
6 votes258 views2 answers
How to print double value up to 9 decimal places in c++
C++