0
A graph has edges A-B, A-C, B-D, B-E, C-F, C-G. What is the order of vertices visited by a Breadth-First Search (BFS) starting from A, visiting neighbours in alphabetical order?
- AA, B, D, E, C, F, G
- BA, B, C, D, E, F, G
- CA, C, B, G, F, E, D
- DA, B, C, F, G, D, E
Correct answer: B