GATE Computer Science (CS) 2014 Shift 1 Solved Paper

© examsiri.com

Question : 13 of 65

Marks: +1, -0

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₁) where E₁ = {(u, v)|(u, v) ∉ E}
G₂ = (V, E₂) where E₂ = {(u, v)|(v, u) ∈ E}
G₃ = (V, E₃) where E₃ = {(u, v)| there is a path of length ≤ 2 from u to v in E}
G₄ = (V₄, E) where V₄ is the set of vertices in G which are not isolated

Go to Question:

Prev Question

Next Question