/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 vote123 views1 answer
C++ get maximum value unsigned int
C++
0 vote119 views1 answer
Normal Initialisation of 3D Vector
C++
0 vote103 views1 answer
How can I delete a substring from a string in c++?
C++
2 votes109 views2 answers
Strlen in c++
C++
7 votes117 views3 answers
C++ get data type
C++
0 vote99 views2 answers
Create a file
C++
0 vote123 views1 answer
What is the system function in c++
C++
4 votes105 views2 answers
Max_element c++
C++
11 votes103 views2 answers
C++ main function
C++
1.2K votes170 views10 answers
Twitch
C++