logic for method to detect cycle in an undirected graph

Question

I was trying to detect a cycle in a directed graph.
While coming up with the logic to solve it, I figured out that a simple graph traversal eq. dfs is sufficient becaus