AQ
z
(i)
OP
(ii)
(Choose 1 answer)
Using depth-first search to produce a spanning tree for the given simple graph, and assume that the vertices are ordered alphabetically. Choose the vertex A as the root of this spanning tree. What is the spanning tree that we obtain?
A. None of the other choices is correct
B. (i)
C. (iv)
AQ
z
AO
CO
OE
CO
OE
(iii)
(iv)
AO
z
AQ
D. (iii)
E. (ii)
wi
35
