010-2004

MO640 - Multiple-choice question

Let G be an acyclic directed graph. The strongly connected components of G are:

1. vertices.
   
2. nontrivial trees, that is, trees with 2 or more vertices.
   
3. cicles, where the edge orientations are disregarded.
   
4. paths with at least one edge.
   
5. None of the above

Original idea by: Cleber Valgas Gomes Mira