# Question: Give an O V E time algorithm to compute the

Give an O (V + E)-time algorithm to compute the component graph of a directed graph G = (V, E). Make sure that there is at most one edge between two vertices in the component graph your algorithm produces.

**View Solution:**## Answer to relevant Questions

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 ...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.Calculate the reversible work out of the two-stage turbine shown in Problem 6.41, assuming the ambient is at 25C. Compare this to the actual work which was found to be 18.08 MW.Fresh water can be produced from saltwater by evaporation and subsequent condensation. An example is shown in Fig. P10.12 where 150-kg/s saltwater, state 1, comes from the condenser in a large power plant, the water is ...Calculate the irreversibility for the process described in Problem 6.63, assuming that heat transfer is with the surroundings at 17C.Post your question