/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 vote309 views1 answer
Partition in STL using vector
C++
11 votes296 views1 answer
Removing a character from a string in c++
C++
99 votes435 views6 answers
How to convert int to string c++
C++
3 votes303 views5 answers
Combine two vectors c++
C++
4 votes323 views3 answers
Number to binary string c++
C++
0 vote288 views1 answer
Why return 0 in int main
C++
1 vote305 views1 answer
How to modify set C++
C++
11 votes297 views3 answers
Count occurrences of character in string c++
C++
0 vote314 views1 answer
C++ formatting
C++
0 vote274 views4 answers
C++ initialize vector of vector with size
C++