(Choose 1 answer)
(See picture)
Given a graph G as shown below.
A. a, b, c, e, g, h, d. f
B. a, b, c, d, e, g. f. h
f
C. a, b, c, d. e. f. g. h
D. a, b, c. e. f. g. h. d
g
h
What is the order of vertices traversed by Breadth First Search algorithm from the vertex a?
Assume that at each level, the vertices are ordered alphabetically.
10/50-CAP
Rsh
Q: 12
