/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

3 votes92 views4 answers
C++ get last character of string
C++
0 vote96 views1 answer
What is require to run min max function on linux in cpp
C++
0 vote101 views1 answer
C++ pass ofstream as argument
C++
0 vote104 views1 answer
Create vectors of vectors c++
C++
4 votes131 views3 answers
Clear screen in c++
C++
6 votes100 views4 answers
String to upper c++
C++
0 vote104 views1 answer
Tabeau pseudo dynamique sur c++
C++
1 vote95 views1 answer
Std::tuple apply multiplier
C++
1 vote94 views1 answer
Two elements with difference K in c++
C++
2 votes99 views1 answer
How to write something in power of a number in c++
C++