3. Show how depth-first search works on the following graph. Assume that 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. Also, show the classification of each edge. V W u 4. Illustrate the operation of PARTITION on the array: A {9, 19, 13, 5, 12, 8, 7, 4, 21, 6, 11}. Let A[1]=9 be the pivot value and use Unit 5 lecture slides (51 through 62) as a model.

3. Show how depth-first search works on the following graph. Assume that 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. Also, show the classification of each edge. V W u 4. Illustrate the operation of PARTITION on the array: A {9, 19, 13, 5, 12, 8, 7, 4, 21, 6, 11}. Let A[1]=9 be the pivot value and use Unit 5 lecture slides (51 through 62) as a model.

Similar questions

Consider the following graph G.
Perform a topological sort for the following DAG. Assume that DFS prioritizes vertices in alphabetical order. m x U W
6. Determine the breadth-first and depth-first traversals for the following graph: (start with vertex A) B A E
Let G be the following graph with 5 vertises: (4) O Write the incidence matrix of G. O Enter your incidence matrix on for other software) and use it to cakulate +the oumber ofpaths of length 10 stacbing at the vertex 1. How Many of these paths end at vertex 1? vertex 2, 3, 4, and5? Pari
Show what the final distance and previous array values will be after running the shortest path algorithm from class on the following graph, starting at vertex 2: 1 6 5 4 4 4 2 7 0 5 5 6 2 2 3 13 6
11. For the given graph below, use the depth-first search algorithm to visit the vertices and write the sequence of the visit. Start from the vertex "A". At any given vertex, you will visit first the unexplored vertex that has least alphabetical order. с G E F Answer the sequence of visiting the vertices: -_