Topic: Discrete Mathematics and its Applications" Chapter 11: Tree: Spanning Trees"

4. Variation on 6.4 #15, 16] For this simple graph, choose vertex a as the root to form a spanning tree. (a) Use depth-first search to produce a spanning tree, using alphabetical order of the vertex names when you have a choice of multiple vertices to visit. You needn't draw the tree, just list the vertices in the order in which they are added to the tree. Answer only; no explanation needed (b) Use breadth-first search to produce a spanning tree. You needn't draw the tree, just list the vertices in the order in which they are added to the tree. Answer only; no explanation needed