Describe an algorithm to detect the existence of a cycle in an undirected graph. Specifically, the input is an undirected graph G = (V, E), and the output is a yes or no answer. The output is yes if and only if there is a cycle in G.