/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 vote158 views1 answer
C++ message box error
C++
0 vote174 views1 answer
Tan ^-1 ti 83
C++
2 votes212 views1 answer
C++ how to loop through a vector but not the last element
C++
-2 votes173 views2 answers
Constants in cpp
C++
-1 vote169 views1 answer
#include
C++
1 vote177 views1 answer
Create file c++
C++
1 vote158 views1 answer
What is difference between single inverted and double inverted in programming languages
C++
0 vote175 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
0 vote197 views1 answer
Qt widget list set selected
C++
1 vote194 views1 answer
Default access specifier in c++
C++