Cycle Detection Using Breadth-First Search

Problem statement

You are given an undirected graph, and you need to check whether there is any cycle or not.

Solution

To solve this problem, either Breadth-First Search or Depth First Search can be used to detect cycles. In the case of a directed graph, only the Depth-First Search can be used. Let’s move on to the implementation as we have already discussed Breadth-First Search and there is only a minor difference in the solution. Let’s look at the code now.