Computer Sciences > Gate 2014 Set-1 > Graph Theory
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
G1 = (V,E1) where E1={(u,v)∣(u,v)∉E}
B
G2 = (V,E2) where E2={(u,v)∣(v,u)∈E}
C
G3 = (V,E3) where E3={(u,v)∣ there is a path of length ≤2 from u to v in E}
D
G4= (V4,E) where V4 is the set of vertices in G which are not isolated

Explanation

Correct : Graph Theory

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science