Traverse the following graph by breadth-first search and print all the vertices
reachable from start vertex 0. Resolve ties by the vertex ascending order
Attachments:
Answers
Answered by
1
Explanation:
0 8 3 1 4 7 2 5 6
I think this is correct.not sure
Similar questions