2022-128

Consider the following oriented network:

Executing a BFS algorithm in this network, starting at node 5, and traversing the adjacent lists in increasing order, we have:

1. All nodes can be reached using this algorithm
2. The node with the highest distance from node 5 is node 6
3. Nodes  2 and 4 have the same distance from node 5
4. Node 8 is assigned as the parent of node 2
5. The highest distance from node 5 is 4 links

The only statements that are correct are:

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

Original idea by: Athyrson Machado Ribeiro