Give Counterexample To The Conjecture If There Is 28481

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

Posted in Uncategorized