Kizspy | Question: 89
(Choose 1 answer)
(See picture)
A. a, b, c, e, g, h, d, f
B. a, b, c, e, f, d, g, h
C. a, b, c, d, e, f, g, h
D. a, b, c, d, e, g, f, h
FUOVERFLOW
g
h
Given a graph G as shown below.
f
What is the order of vertices traversed by Depth First Search algorithm from the vertex a?
Assume that at each step, if there are more than one choice then the vertex is chosen in the alphabetical order.
