Use Exercise 60 to construct an algorithm for determining whether a directed graph contains a circuit. In

Question:

Use Exercise 60 to construct an algorithm for determining whether a directed graph contains a circuit.
In exercise
Show that if G is a directed graph and T is a spanning tree constructed using depth-first search, then G contains a circuit if and only if G contains a back edge (see Exercise 51) relative to the spanning tree T .