/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 vote126 views7 answers
Online compiler to calculator time complexity
C++
14 votes129 views6 answers
How to get size of array c++
C++
0 vote140 views1 answer
Do c++ ints neeed to be initlaized
C++
0 vote134 views1 answer
Template member functions in cpp files
C++
1 vote134 views2 answers
Struct constructor in c++
C++
1 vote121 views1 answer
Concurrency in c++
C++
0 vote141 views1 answer
Cpp serial print override always in same place
C++
0 vote132 views1 answer
C++ insertion in astack
C++
0 vote115 views1 answer
Converting a for loop to a while loop C++
C++
1 vote212 views1 answer
How to declare 1-D array in C/C++
C++