###
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 ?

*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) G_{1} = (V, E_{1}) where E_{1} = {(u, v)|(u, v) ? E} |

(B) G_{2} = (V, E_{2}) where E_{2} = {(u, v)|(u, v) ? E} |

(C) G_{3} = (V, E_{3}) where E_{3} = {(u, v)| there is a path of length ? 2 from u to v in E } |

(D) G_{4} = (V, E_{4}) where V_{4} is the set of vertices in G which are not isolated |

**{{explanations.length}} Explanations**

**Explain this Question**