1 Assume that the following graph is traversed in depth-first fashion, beginning with the vertex labeled A. Write a list of the labels in an order in which they might be visited. 2 Assume that the...

1 Assume that the following graph is traversed in depth-first fashion, beginning with the vertex labeled A. Write a list of the labels in an order in which they might be visited.

2 Assume that the graph in Exercise 1 is traversed in breadth-first fashion, beginning with the vertex labeled A. Write a list of the labels in the order in which they are visited.

3 Describe, informally without pseudocode, a strategy for performing a breadth-first traversal of a graph.