/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

7 votes245 views1 answer
Nearest integer rounding in c++
C++
25 votes227 views5 answers
Sort vector in descending order c++
C++
4 votes228 views1 answer
Convert all characters in string to uppercase c++
C++
0 vote231 views1 answer
Google pdf iframe viwer
C++
0 vote262 views1 answer
Glm multiply vector by scalar
C++
0 vote247 views1 answer
Post order from preorder and inorder calculator
C++
2 votes215 views1 answer
Pointer dereference
C++
3 votes222 views2 answers
Lambda function in c++
C++
0 vote241 views1 answer
Changing key bindings in visual code not working
C++
0 vote224 views1 answer
Softwareegg.courses4u
C++