/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

0 vote333 views2 answers
Shortest path in unweighted graph bfs
C++
3 votes343 views1 answer
Sfml draw line
C++
0 vote364 views1 answer
C++ sorting and keeping track of indexes
C++
1 vote375 views4 answers
C++ pause
C++
0 vote349 views1 answer
Three-way comparison c++
C++
1 vote328 views1 answer
Stock a file in a vector cpp
C++
0 vote379 views1 answer
How to check char array equality in c++
C++
0 vote348 views1 answer
How to grab each character from a string
C++
0 vote335 views1 answer
C++ clear char array
C++
10 votes395 views3 answers
C++ check if file exits
C++