Run DFS on the graph in Fig. 22.8 (p. 615), under the assumption that the adjace

Question

Run DFS on the graph in Fig. 22.8 (p. 615), under the assumption that the
   adjacency list is ordered as stated in Ex. 22.3-2 (p. 610). Show the
   discovery and finish times for each vertex, and show the classification of
   each edge. Show the topological order of vertices obtained by this run of DFS.

Figure 22.8 A dag for topological sorting. 22.3-2 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.

Explanation / Answer

The DFS for the given graph is as follows:-

m -> q -> t -> x -> r -> u -> y -> v -> w -> z

Now backtracking will be applied so that stack can be empty.

The vertices n , o, s and p cannot be traversed because there is no incoming edge presents.

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.