# Question

Show that edge (u, v) is

a. a tree edge or forward edge if and only if d[u] < d[v] < f[v] < f[u],

b. a back edge if and only if d[v] < d[u] < f[u] < f[v], and

c. a cross edge if and only if d[v] < f[v] < d[u] < f[u].

a. a tree edge or forward edge if and only if d[u] < d[v] < f[v] < f[u],

b. a back edge if and only if d[v] < d[u] < f[u] < f[v], and

c. a cross edge if and only if d[v] < f[v] < d[u] < f[u].

## Answer to relevant Questions

Give a counterexample to the conjecture that if there is a path from u to v in a directed graph G, and if d[u] < d[v] in a depth-first search of G, then v is a descendant of u in the depth-first forest produced.Another way to perform topological sorting on a directed acyclic graph G = (V, E) is to repeatedly find a vertex of in-degree 0, output it, and remove it and all of its outgoing edges from the graph. Explain how to implement ...Give a simple example of a graph such that the set of edges {(u, v): there exists a cut (S, V - S) such that (u, v) is a light edge crossing (S, V - S)} does not form a minimum spanning tree.A household refrigerator has a freezer at TF and a cold space at TC from which energy is removed and rejected to the ambient at TA as shown in Fig. P10.5An air compressor receives atmospheric air at T0 = 17C, 100 kPa, and compresses it up to 1400 kPa. The compressor has an isentropic efficiency of 88% and it loses energy by heat transfer to the atmosphere as 10% of ...Post your question

0