Multiple choices 38/50
(Choose 1 answer)
Use a depth-first search to produce a spanning tree for the given simple graph. Choose d as the root of this spanning tree and assume that the vertices are ordered alphabetically.
h
A. None of the other choices is correct.
B. ac, ef, dh
h
C. ac, ef, hg
D. bc, df, hg
Next
E. bc, df, eh
Which edges will be removed?
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
