2025-001
A group of friends is organizing a secret message run using an oriented and unweighted graph. Each number represents a person, and each area indicates so that the message can be reviewed directly. The graph is shown below: The message starts at friend 1. Considering the execution of the Breadth-First Search (BFS) algorithm starting at 1, and assuming that the adjacency lists are sorted in ascending order, which of the options below correctly shows the order of visitation of the nodes? A. 1 – 2 – 3 – 4 – 5 – 6 B. 1 – 3 – 2 – 5 – 4 – 6 C. 1 – 2 – 3 – 5 – 4 – 6 D. 1 – 3 – 5 – 2 – 4 – 6 E. None of the above Autor: Giancarlo Maldonado Cárdenas