Give a counterexample to the conjecture that if a directed graph G contains a path from u

Question:

Give a counterexample to the conjecture that if a directed graph G contains a path from u to ν, then any depth-first search must result in ν.d ≤ u.f.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: