/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 vote273 views1 answer
Marksheet make in the c++
C++
0 vote277 views1 answer
Print linked list reverse order in c++
C++
1 vote282 views4 answers
How to use string in c++
C++
0 vote261 views1 answer
Cicli informatica c++
C++
0 vote298 views1 answer
Factorial using recursion cpp
C++
0 vote297 views1 answer
Has substr c++
C++
2 votes299 views1 answer
Hwo to calculate the number of digits using log in c++
C++
-2 votes313 views4 answers
Function Template in c++
C++
0 vote277 views1 answer
Declare static table filled cpp
C++
0 vote267 views1 answer
How to make a number always positive in c++
C++