Contribute to TMSDMAP/BFS-DFS-Algorithm development by creating an account on GitHub.

int vis [N]; bool dfs (int vertex, int par) { // Iterate over all children of the current vertex vis [vertex]=true; // as though one of the child of a cycle might return false and othe return true // ...