/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 vote122 views1 answer
Floor and ceil in cpp
C++
1 vote156 views3 answers
How to take space separated input in c++
C++
1 vote145 views1 answer
Stock a file in a vector cpp
C++
1 vote302 views1 answer
How to iterater map of sets in c++
C++
3 votes116 views2 answers
Find kth max and min element in an array
C++
0 vote131 views1 answer
Zero fill in c++
C++
0 vote167 views1 answer
How to make window resizable in sdl
C++
0 vote122 views1 answer
How to play sound in c++
C++
1 vote114 views1 answer
Penjanje
C++
0 vote149 views1 answer
What is 10 + (-4)
C++