Q1Multiple correct4 Marks10 May 2026

Consider the directed graph given below: Suppose we perform BFS/DFS so that when we visit a vertex, we explore its unvisited neighbours in a random order. Which of the following options are correct?

A

If we perform Depth First Search at node $0$, then one of the possible orders in which the nodes will be visited is $05142367$.

B

If we perform Depth First Search at node $0$, then one of the possible orders in which the nodes will be visited is $01453672$.

C

If we perform Breadth First Search at node $0$, then one of the possible orders in which the nodes will be visited is $01542367$.

D

If we perform Depth First Search at node $0$, then one of the possible orders in which the nodes will be visited is $01543267$.