2022-079

Consider the following statements concerning the execution of a DFS in an undirected graph.

I. There are no cross edges.

II. There are only tree edges.

III. There are no forward edges.

IV. There are no backward edges.

V. It is not possible to perform a DFS in an undirected graph

Select the alternative that lists all the correct statements and no false statement:

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

Original idea by: Heitor Mattosinho