/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 votes254 views1 answer
Switch case with string c++
C++
0 vote266 views1 answer
C++ put a function in a other thread
C++
7 votes272 views2 answers
Include all libraries in c++
C++
0 vote244 views3 answers
C++ loop through list
C++
0 vote285 views1 answer
10^18 data type in c++
C++
0 vote311 views1 answer
Find number of 1s in a binary cv::mat image
C++
0 vote257 views1 answer
Vector of shared_ptr c++ push_back
C++
3 votes238 views1 answer
Stl library c++ header
C++
0 vote259 views1 answer
String reverse iterator c++
C++
8 votes223 views1 answer
How to print every element of the array in cpp
C++