Input | Output |
---|---|
The adjacency list of a directed graph is given as follows. Starting from the vertex V1 and traversing according to the depth-first search method, the obtained vertex sequence is<image 1> (A) V1,V5,V4,V7,V6,V2,V3 (B) V1,V2,V3,V4,V7,V6,V5 (C) V1,V5,V4,V7,V6,V3,V2 (D) V1,V5,V6,V4,V7,V2,V3 Answer with the option's letter from the given choices directly. No punctuation. | A Expected Answer: C Difficulty: Easy Subfield: Data Structure and Algorithm |