# Question: A directed graph G V E is said to be semi

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 that your algorithm is correct, and analyze its running time.

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

A depth-first forest classifies the edges of a graph into tree, back, forward, and cross edges. A breadth-first tree can also be used to classify the edges reachable from the source of the search into the same four ...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 ...An air compressor takes air in at the state of the surroundings 100 kPa, 300 K. The air exits at 400 kPa, 200C at the rate of 2 kg/s, determine the minimum compressor work input.An 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 ...A control mass gives out 10 kJ of energy in the form of a. Electrical work from a battery b. Mechanical work from a spring c. Heat transfer at 500C Find the change in availability of the control mass for each of ...Post your question