Kizspy | Question: 44
(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. (i)
B. (ii)
C. (iii)
D. (iv)E. None of the other choices is correct
z
(i)
(ii)
zQ
z
CO
OE
co
(iii)
(iv)
z
z
