The search algorithms discussed in class were; Breadth first search, Depth First search, Kruskals Algorithm, Prims Algorithm, Reverse-Delete Algorithm, Djikstras Algorithm, Greedy Algorithm

2. Which of the search algorithms covered in class could be adapted to determine if an undirected graph has a cycle? Explain your approach in detail and prove it is correct. What would be its time complexity