/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 vote383 views1 answer
Multiply two numbers <=10^18 %m in cpp
C++
0 vote351 views1 answer
C++ foreach vector
C++
5 votes344 views1 answer
Screen record ios simulator
C++
1 vote338 views4 answers
Sum vector c++
C++
0 vote305 views1 answer
Honeygain linux
C++
0 vote324 views1 answer
Difference between --a and a-- c++
C++
0 vote319 views1 answer
Idnefier endl in undefince
C++
0 vote323 views1 answer
Syntax of member function in c++
C++
0 vote341 views1 answer
I++ and++i
C++
7 votes334 views5 answers
Sleep c++
C++