Show how depth-first search works on the graph of Figure 22.6. Assume that the?for?loop of lines 5-7 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.

Figure 22.6?A directed graph for use in Exercises 22.3-2 and 22.5-2.

Transcribed Image Text:

W n