/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

92 votes327 views6 answers
String reverse
C++
0 vote185 views1 answer
How to shorten code using using c++ in class with typename
C++
2 votes218 views1 answer
++x vs x++
C++
0 vote158 views1 answer
Scss variable is not defined
C++
2 votes203 views2 answers
Print stack c++
C++
0 vote196 views1 answer
Cpp pass function with input to thread
C++
-1 vote202 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
5 votes183 views6 answers
Do while loop c++
C++
1 vote220 views2 answers
Torch cuda is available
C++
0 vote188 views1 answer
Disabling console exit button c++
C++