/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 vote179 views1 answer
How to take full sentence in c++
C++
3 votes201 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
0 vote189 views1 answer
Walk filesystem in c++
C++
0 vote192 views1 answer
Five
C++
3 votes213 views2 answers
C++ map insert
C++
1 vote176 views1 answer
Std::stack
C++
0 vote194 views1 answer
What is the default include path in ubuntu c++
C++
1 vote150 views1 answer
How to fill all of the array in c++
C++
4 votes176 views1 answer
C++ array vs vector
C++
0 vote179 views1 answer
Setw in c++
C++