Which of the following techniques/algorithms cannot be used to detect cycles in an undirected and unweighted graph? N.B: A cycle in a graph refers…

Which of the following techniques/algorithms cannot be used to detect cycles in an undirected and unweighted graph?

N.B: A cycle in a graph refers to a path where the starting and ending vertices are the same.

1. a) Disjoint Set Data Structure
2. b) Breadth First Search
3. c) Depth First Search
4. d) Floyd-Warshall algorithm