Given an undirected graph described as a set of edges, detect whether it contains a loop (cycle), which means the structure is not a valid tree. Then write pseudo code for DFS and BFS traversal.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.