Kizspy | Question: 118
(Choose 1 answer)
(See picture)
A. bf, be, bc
B. ac, ae, ag
C. ac, ae, af
D. ac, bf, be
E. be, ae, bc
F. be, ae, bf
If we do depth-first search to build a spanning tree starting from 'd', what are the last 3 edges we will add to the tree?
We suppose that at each stage, if we have many choices, we will visit the vertices in the reverse alphabet order (forexample, we will visit 'b' before 'a' if there are two choices 'a'and 'b').
f
