/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

8 votes135 views2 answers
Simple c++ program
C++
2 votes130 views2 answers
How to check if java is installed on windows 10
C++
0 vote150 views1 answer
Power Function in C/C++
C++
0 vote159 views1 answer
Walk filesystem in c++
C++
1 vote135 views1 answer
For loop vector
C++
6 votes142 views2 answers
How to print a decimal number upto 6 places of decimal in c++
C++
0 vote159 views1 answer
Log base 2 in c++
C++
0 vote164 views1 answer
Program in c++ for simple interest rate
C++
0 vote180 views1 answer
Sort strings by length and by alphabet
C++
0 vote145 views1 answer
How to find min of two numbers in c++
C++