1. Write pseudocode for an iterative algorithm that determines a DFS spanning tree for an undirected graph. Base your algorithm on the traversal algorithm dfs . 2. Draw the minimum spanning tree for...

1. Write pseudocode for an iterative algorithm that determines a DFS spanning tree for an undirected graph. Base your algorithm on the traversal algorithm dfs .

2. Draw the minimum spanning tree for the graph in Figure 20-22 when you start with

a. Vertex g