Question
Let be a directed graph where is the set of vertices and the set of edges. Then which one of the following graphs has the same strongly connected components as ?
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 and belong to the same strongly connected component (SCC) in a directed graph if and only if there is a directed path from to and a directed path from to .
In the transpose graph where , every edge is reversed in direction.
- A path in corresponds directly to a path in .
- Therefore, and are mutually reachable in if and only if they are mutually reachable in .
Consequently, the equivalence classes of mutual reachability are identical, so has the exact same strongly connected components as .
B
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.