0
A directed graph has the adjacency lists A: B, C; B: D; C: D, E; D: F; E: F; F: (none). A depth-first search starts at A and visits neighbours in the listed order. What is the order of visiting?
- AA B C D E F
- BA B D F C E
- CA C E F D B
- DA B D C E F
Correct answer: B