For an n-vertex undirected graph, the time required to find a cycle i

1.	For an n-vertex undirected graph, the time required to find a cycle is ____________
A.	O(n)
B.	O(n2)
C.	O(n+1)
D.	O(logn)
Answer» B. O(n2)

Discussion