22.3-8 in Intro to Algorithms, 3rd edition

Give a counterexample to the conjecture that if a directed graph G contains a path from u to v, and if u.d < v.d in a depth-first search of G, then v is adescendant of u in the depth-first forest produced