0
For the same graph (edges A-B, A-C, B-D, B-E, C-F, C-G), what is the order of vertices visited by a Depth-First Search (DFS) starting from A, visiting neighbours in alphabetical order?
- AA, B, C, D, E, F, G
- BA, B, D, E, C, F, G
- CA, C, G, F, B, E, D
- DA, B, D, C, E, F, G
Correct answer: B