/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

10 votes202 views2 answers
2d vector c++ declaration
C++
6 votes187 views2 answers
Include pdf file in latex
C++
0 vote204 views2 answers
Memory leak in cpp
C++
1 vote169 views1 answer
How to run a c++ program in the background
C++
1 vote177 views1 answer
Check if double is integer c++
C++
0 vote167 views1 answer
Even and odd sum in c++
C++
2 votes170 views2 answers
C++ typedef array
C++
0 vote163 views1 answer
Flag controlled while loop c++
C++
1 vote173 views2 answers
C++ array sort method
C++
2 votes178 views2 answers
What is typedef
C++