/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

30 votes225 views5 answers
Remove value from vector c++
C++
0 vote244 views1 answer
Array copx c++
C++
0 vote227 views1 answer
Normal Initialisation of 3D Vector
C++
4 votes232 views3 answers
Std vector random shuffle
C++
4 votes214 views1 answer
Cpp iterator of element
C++
0 vote253 views1 answer
Functors in c++
C++
1 vote232 views1 answer
Cpp goiver all the map values
C++
-1 vote223 views5 answers
C++ string split
C++
0 vote222 views1 answer
Code debut C++
C++
0 vote243 views1 answer
How to find total numbe of distinct characters in a string in c
C++