Perform a BFS traversal of this directed graph, starting at node d. When picking which neighbor to visit first, go in alphabetical order.
Which of the following sequence represents the order of node visits?
d, c, e, b, f, a, g
d, c, e, a, b, f, g
d, c, a, b, f, g,e
d, c, a, b, e, f, g
Which of the following sequence represents the order of node visits?
Od,c,e,b.f.a.g
Od,c,ea,b,f.g
Od,c.a,b,f.g.e
Oa,c,abef.g