GATE DA 2026 | Python & DS | Memory Based | Question 45

Let $G=(V,E)$ be a directed graph, and let $G^R$ denote the graph obtained by reversing all the edges of $G$.

Which of the following statements is/are TRUE?

1. If a vertex $v$ is reachable from a vertex $u$ in $G$ using DFS, then $u$ is reachable from $v$ in $G^R$ using BFS.
    
2. If $G$ is weakly connected, then $G^R$ is not weakly connected.
    
3.  The set of strongly connected components of $G$ is always different from the set of strongly connected components of $G^R$.
    
4. For every vertex $u$, the out-degree of $u$ in $G$ is equal to the out-degree of $u$ in $G^R$.