2022-096

Consider the following statements about this graph:

1. Starting at node A, a DFS visiting order could be: A, B, E, F, C, D, G and a BFS visiting order could be: A, B, C, D, E, F, G
2. Starting at node A, a BFS visiting order could be: A, B, E, F, C, D, G and a DFS visiting order could be: A, B, C, D, E, F, G
3. There is at least one back edge on the graph, and the back edges are always the same, no matter what the DFS starting point is

Now select the alternative that lists only the true statements:

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

Original idea by: Victória Pedrazzoli