/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 vote198 views1 answer
Srand() c++
C++
2 votes187 views1 answer
Pointer dereference
C++
0 vote217 views1 answer
How to move your chrector in unity
C++
0 vote216 views1 answer
Print linked list reverse order in c++
C++
2 votes205 views1 answer
Check if a string is palindrome cpp
C++
0 vote212 views1 answer
Get value of enum cpp
C++
18 votes237 views2 answers
Stl for sorting IN C++
C++
0 vote174 views1 answer
What is the "-->" operator in C/C++?
C++
-1 vote266 views6 answers
Wine linux
C++
34 votes232 views6 answers
C++ string to int
C++