/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

4 votes198 views3 answers
Clear screen in c++
C++
1 vote181 views1 answer
Optimized Bubble Sort
C++
17 votes150 views1 answer
Input a string in c++
C++
5 votes177 views2 answers
Delete specific row from dynamic 2d array c++
C++
0 vote179 views1 answer
Cin does not wait for input
C++
0 vote212 views1 answer
How to make window resizable in sdl
C++
0 vote161 views1 answer
How to manually start windows app
C++
0 vote548 views1 answer
Set keybinding for compiling c++ program in neovim
C++
4 votes156 views1 answer
Clear file before writing c++
C++
5 votes180 views1 answer
Ue4 log float
C++