EEE 5543 Random Signal Principles Spr

1. Complete a breadth-first search traversal on the following graph, starting from vertex 7. As with all our previous examples, when you are considering adjacent vertices for adding to the traversal you must consider them in increasing numerical order. For this question, you need only list the vertices in the order in which they are visited in a comma separated list (i.e., 1, 2, 3, 5) (n.b., spacing does not matter); you do not need to construct the spanning tree. [6 marks] 0 V 3 6 2 5 4