Question

Let G=(V,E)G=(V,E) be a directed graph where VV is the set of vertices and EE the set of edges. Then which one of the following graphs has the same strongly connected components as GG ?

Choose one option
Official answer and solution
Official answer
B
From
Official GATE 2014 answer key

Solution

Recall the definition of strongly connected components and the effect of graph transposition on mutual reachability.

Two vertices uu and vv belong to the same strongly connected component (SCC) in a directed graph G=(V,E)G = (V, E) if and only if there is a directed path from uu to vv and a directed path from vv to uu.

In the transpose graph G2=(V,E2)G_2 = (V, E_2) where E2={(u,v)∣(v,u)∈E}E_2 = \{(u, v) \mid (v, u) \in E\}, every edge is reversed in direction.

  • A path u⇝vu \rightsquigarrow v in GG corresponds directly to a path v⇝uv \rightsquigarrow u in G2G_2.
  • Therefore, uu and vv are mutually reachable in GG if and only if they are mutually reachable in G2G_2.

Consequently, the equivalence classes of mutual reachability are identical, so G2G_2 has the exact same strongly connected components as GG.

Final answer

B

Common trap

Assuming that reversing all edges changes the component structure, whereas it only preserves mutual reachability.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2014 Computer Science and Information Technology (CS) Session 1
Question
13 of 65, printed as CS Q.3
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.