Multiple choices 43/50
(Choose 1 answer)
Use depth-first search to produce a spanning tree for the given simple graph. Assume that the vertices are ordered alphabetically.
(See picture)
A. G. I
B. F. H
C. F. I
G
D. G. H
E. E. D
Next
F
H
The vertices at level 3 of this spanning tree with its root A is
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
