/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 vote396 views1 answer
Multiply two numbers <=10^18 %m in cpp
C++
5 votes333 views1 answer
#include<bits/stdc++.h>
C++
1 vote369 views1 answer
Preorder
C++
0 vote406 views1 answer
Tic toc toe c++
C++
3 votes324 views2 answers
Access last element of set c++
C++
3 votes325 views1 answer
How to convert qt string to string
C++
0 vote349 views1 answer
What c++ library is arccos in
C++
15 votes369 views3 answers
String to char array c++
C++
8 votes475 views1 answer
Venge io
C++
0 vote302 views3 answers
C++ comment
C++