22.3-2 Show how depth-first search works on the graph of Figure 22.6. Assume that the for loop of lines 57 of the DFS procedure considers the vertices in alphabetical order, and assume that each adjacency list is ordered alphabetically. Show the discovery and finishing times for each vertex, and show the classification of each edge. 22.3 Depth-first search 611 V w