/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 vote168 views1 answer
How to use qdebug c++
C++
0 vote180 views1 answer
Get map values c++
C++
0 vote162 views1 answer
How to extract a bit from a byte in c++
C++
0 vote172 views1 answer
C++ unittest in ros
C++
0 vote173 views1 answer
How to read qlistwidget in c++
C++
0 vote154 views2 answers
Interface in c++
C++
6 votes151 views2 answers
Stack erase
C++
0 vote155 views3 answers
Bool function in c++
C++
0 vote150 views1 answer
Hola mundo c++
C++
1 vote161 views3 answers
Print 2d vector c++
C++