# Question

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

(c) E′ is as small as possible. Describe a fast algorithm to compute G′.

(a) G′ has the same strongly connected components as G,

(b) G′ has the same component graph as G, and

(c) E′ is as small as possible. Describe a fast algorithm to compute G′.

## Answer to relevant Questions

A directed graph G = (V, E) is said to be semi connected if, for all pairs of vertices u, v ¬ V, we have u →v or v→ u. Give an efficient algorithm to determine whether or not G is semi connected. Prove ...Show that a graph has a unique minimum spanning tree if, for every cut of the graph, there is a unique light edge crossing the cut. Show that the converse is not true by giving a counterexample.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 ...The high-temperature heat source for a cyclic heat engine is a SSSF heat exchanger where R-134a enters at 80C, saturated vapor, and exits at 80C, saturated liquid at a flow rate of 5 kg/s. Heat is rejected ...Post your question

0