Q4 (18 points) An undirected graph G is shown in Figure 3. Assume that the adjacency lists are in
alphabetical order. Apply depth-first search (DFS) on graph G. In the main-loop of DFS, check the
vertices in alphabetical order. Figure 3: Graph for Q4. (a) On the answer sheet, enter the
discovery times of selected vertices computed by the DFS. (b) On the answer sheet, enter the
finish times of selected vertices computed by the DFS. (c) On the answer sheet, enter the
predecessors of selected vertices computed by the DFS.(a): After the DFS on G, the discovery
times for vertices C,F,H are C.d= Fd= (b): After the DFS on G, the finish times for vertices B+/,/l
are B. f= f.f= .f=After the DFS on G, th predecessors for vertices D,I,J are.
Q4 18 points An undirected graph G is shown in Figure 3 A.pdf
1. Q4 (18 points) An undirected graph G is shown in Figure 3. Assume that the adjacency lists are in
alphabetical order. Apply depth-first search (DFS) on graph G. In the main-loop of DFS, check the
vertices in alphabetical order. Figure 3: Graph for Q4. (a) On the answer sheet, enter the
discovery times of selected vertices computed by the DFS. (b) On the answer sheet, enter the
finish times of selected vertices computed by the DFS. (c) On the answer sheet, enter the
predecessors of selected vertices computed by the DFS.(a): After the DFS on G, the discovery
times for vertices C,F,H are C.d= Fd= (b): After the DFS on G, the finish times for vertices B+/,/l
are B. f= f.f= .f=After the DFS on G, th predecessors for vertices D,I,J are
