/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

1 vote101 views2 answers
Calling by reference c++
C++
90 votes196 views5 answers
Tostring c++
C++
11 votes95 views1 answer
Inserting at start in vector c++
C++
0 vote104 views1 answer
How to find data size in c++
C++
1 vote155 views1 answer
Print linked list recursively c++
C++
3 votes96 views1 answer
Convert refference to pointer c++
C++
0 vote108 views1 answer
Windows install cppcheck
C++
0 vote93 views1 answer
C++ calorie calculator using a for loop
C++
0 vote154 views1 answer
How to use printf with <cinttypes> c++
C++
9 votes96 views4 answers
Print vector of vector c++
C++