A directed graph G is shown in the figure below. 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.
Q1.1
2 Points
Enter the discovery times of selected vertices computed by the DFS.
After the DFS on G, the discovery times for vertices B, D, H are
B.d =
Q1.2
2 Points
D.d =
Q1.3
2 Points
H.d =
Please provide a detailed explanation with drawings for better understanding.