/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 vote289 views1 answer
Cpp sample code
C++
2 votes263 views2 answers
C++ typedef array
C++
2 votes289 views1 answer
Arduino sprintf float
C++
0 vote349 views1 answer
Esp8266 wifi.localip() to string
C++
1 vote268 views1 answer
Union of two arrays leetcode
C++
0 vote342 views1 answer
C++ basic snippet
C++
0 vote289 views1 answer
Read large files part by part in C++
C++
1 vote261 views1 answer
Memcpy c++ usage
C++
0 vote278 views1 answer
Transform c++
C++
0 vote302 views1 answer
If not c++
C++