2022-179

Consider the following statements about strongly connected components (SCC):

1. The graph $G^{\prime }$, obtained by contracting the strongly connected components of $G$, is necessarily acyclic.
   
2. The strongly connected components of a graph $G$ and its transpose $G^T$ are the same.
   
3. It is possible to use the DFS algorithm to find the strongly connected components of a graph. More specifically, two DFS executions must be performed, and the first one is used to find the order of seeds for the second execution.
   

The true statements are:

1. I, II and III
   
2. II and III
   
3. II
   
4. III
   
5. None of the above.

Original idea by: André Nóbrega