/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 vote303 views1 answer
Reading in lines from a file to a vector c++
C++
1 vote325 views1 answer
In c++ ++ how to write if without if
C++
1 vote306 views1 answer
Stock a file in a vector cpp
C++
0 vote315 views1 answer
Binary add using strings
C++
0 vote316 views1 answer
Finding nth most rare element code in c++
C++
0 vote332 views1 answer
I++ and++i
C++
0 vote321 views1 answer
Arduino falling edge
C++
0 vote301 views1 answer
Error uploading arduino code
C++
4 votes319 views2 answers
C++ inline if
C++
1 vote326 views3 answers
Pdf to text python 3
C++