Q. 13 Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G ?
(A)G1G1 = (V,E1)(V,E1) where E1={(u,v)∣(u,v)∉E}E1={(u,v)∣(u,v)∉E}
(B)G2G2 = (V,E2)(V,E2) where E2={(u,v)∣(v,u)∈E}E2={(u,v)∣(v,u)∈E}
(C)G3G3 = (V,E3)(V,E3) where E3={(u,v)∣E3={(u,v)∣ there is a path of length ≤2≤2 from uu to vv in E}E}
(D)G4G4 = (V4,E)(V4,E) where V4V4 is the set of vertices in GG which are not isolated
Answer: (B)
Explanation:
