/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 vote121 views2 answers
Accepting multiple values from a function in cpp
C++
0 vote141 views1 answer
Udo apt install dotnet-sdk-5
C++
0 vote136 views1 answer
#defie in c++
C++
1 vote149 views3 answers
Reverse string c++
C++
1 vote163 views2 answers
Pain
C++
0 vote151 views1 answer
Print number with leading zeros
C++
0 vote131 views1 answer
Use regex replace in c++
C++
0 vote123 views2 answers
C ++ splitlines
C++
0 vote143 views2 answers
C++ program to find prime number using function
C++
0 vote152 views1 answer
Find the biggest element in the array
C++