#### 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 v.d ≤ u.f.

Verified

#### Step 1

1 of 10

An idea would be to end a branch of a graph with $u$ and then go back to $v$. That would give us $v.d>u.f$, which is what we have to show.
[7pt]

We need not look any further for a counterexample, in fact, we only need to look back to a previous problem where we had the following search:

## Create an account to view solutions

#### Computer Organization and Design MIPS Edition: The Hardware/Software Interface

5th EditionDavid A. Patterson, John L. Hennessy
220 solutions

#### Fundamentals of Database Systems

7th EditionRamez Elmasri, Shamkant B. Navathe
687 solutions

#### Introduction to Algorithms

3rd EditionCharles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen
726 solutions

#### Introduction to the Theory of Computation

3rd EditionMichael Sipser
389 solutions