/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

0 vote122 views1 answer
C++ Attribute Parser
C++
0 vote118 views4 answers
C++ template
C++
1 vote115 views1 answer
Taking a vector in c++ containing element
C++
0 vote121 views3 answers
C++ comment
C++
1 vote134 views1 answer
C++ 20 struct initialization
C++
0 vote123 views6 answers
Python converter to c
C++
3 votes110 views4 answers
Typedef
C++
0 vote126 views1 answer
Search a word in cpp file
C++
0 vote115 views1 answer
How to declare a 2D vector in c++ of size m*n with value 0
C++
0 vote122 views1 answer
Entering char in int c++ avoid loop
C++