13.03.2026 | BFS

Consider the following statements regarding a Breadth-First Search (BFS) traversal of the graph. Assume that whenever multiple neighbor nodes are available for expansion, they are selected in ascending numerical order:

I. The BFS traversal path when starting from node 1 is: 2-4-6-3-7-9-10-5-8. 
II. Nodes 5 and 8 are the furthest from node 1, just as node 1 is the furthest node when the search is initiated from either node 5 or 8.
III. Adding an edge between nodes 9 and 8 alters the path when expanding from node 1, causing node 8 to be discovered before node 5.
IV. Adding a new edge between nodes 2 and 7 makes no difference to the generated path when starting the expansion from node 1.

The alternative that represents the correct statements is:
a) Only statements I and II are correct.
b) Only statements I, III, and IV are correct.
c) Only statements II and IV are correct.
d) Only statements IIII and IV are correct.
e) None of the above.

Original idea by: Yuri S. Costa