Multiple choices 17/50
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?
(Choose 1 answer)
A. (ii)
B. (iv)
C. None of the other choices is correct
D. (i)
E. (iii)
Next
(i)
(iii)
CO
OE
CO
OE
CO
OE
z
CO
OE
CO
OE
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17 18 19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36 37
38
39 40
41 42 43
44
45
46 47
48 49 50
