/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

2 votes158 views1 answer
Getch c++ library
C++
0 vote111 views7 answers
Hexo
C++
7 votes109 views1 answer
Insert at position in vector c++
C++
0 vote114 views1 answer
The smallest element from three
C++
0 vote142 views1 answer
Java to puthon converter
C++
1 vote117 views1 answer
Print 5 table in c++
C++
2 votes124 views1 answer
C++ print colorful
C++
0 vote125 views1 answer
Syntax of member function in c++
C++
-1 vote137 views1 answer
How to pass arrays by reference c++
C++
1 vote153 views3 answers
Print 2d vector c++
C++