# Question: Give a counterexample to the conjecture that if there is a

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].

## Relevant Questions

Explain how a vertex u of a directed graph can end up in a depth-first tree containing only u, even though u has both incoming and outgoing edges in G.Given a directed graph G = (V, E), explain how to create another graph G′ = (V, E′) such that (a) G′ has the same strongly connected components as G, (b) G′ has the same component graph as G, and ...Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that T is still a minimum spanning tree for G. More formally, let T be a minimum spanning tree for G with edge ...A supply of steam at 100 kPa, 150C is needed in a hospital for cleaning purposes at a rate of 15 kg/s. A supply of steam at 150 kPa, 250C is available from a boiler and tap water at 100 kPa, 15C is ...Air enters the turbocharger compressor of an automotive engine at 100 kPa, 30C, and exits at 170 kPa, the air is cooled by 50C in an intercooler before entering the engine. The isentropic efficiency of the ...Post your question