Describe how the depth-first search algorithm can be used
Chapter 7, Problem 35(choose chapter or problem)
Describe how the depth-first search algorithm can be used in a connected (undirected) graph to detect the presence of cycles in the graph. (While it is simple to look at Figure 7.13 and see that abcea, for example, is a cycle, in a huge graph with thousands of node and arcs, a cycle may be less easy to spot, in addition to which you might not even have a visual representation.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer