/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 vote262 views1 answer
Declaring array of int
C++
0 vote275 views1 answer
Cmd color text c++
C++
0 vote259 views1 answer
C++ std::find with lambda
C++
0 vote324 views1 answer
C++ if bool true
C++
0 vote286 views1 answer
Check whether kth bit is 1
C++
3 votes267 views1 answer
Vectors in c++
C++
19 votes271 views1 answer
C++ writing to file
C++
0 vote286 views1 answer
C++ tokenize string
C++
0 vote250 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
2 votes275 views1 answer
C++ get file content
C++