/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 vote323 views2 answers
Substring function in c++
C++
1 vote320 views1 answer
How to round to nearest whole number unity
C++
-2 votes342 views4 answers
Function Template in c++
C++
0 vote300 views2 answers
Or in c++
C++
0 vote254 views2 answers
Shell sort descending order c++
C++
3 votes306 views1 answer
Howt o initialize 3d vector in c++
C++
2 votes306 views3 answers
Cpp compiler online
C++
1 vote336 views1 answer
C++ isalphanum
C++
0 vote319 views1 answer
Visual studio getline not working
C++
0 vote324 views1 answer
C++ check if number is even or odd
C++