(Part a ONLY),
but with very specific directions and enhancements, asfollows:
Using the graph in Figure 7.29 (Page 377), carry out Algorithm7.4
(DFS-Trace, Page 346) starting at node A.
Annotate each vertex with the discoverTime/finishTime numbers
(see Figure 7.16 on Page 348 for sample numbers),
AND label each edge as a tree, back, descendant, or crossedge
(see Figure 7.15 on Page 344 for sample labels; it’s OK to shortenthe
labels to t, b, d, c).
Note that the conditions in Part (a) of Problem 7.11 imply thatwhen
processing the edges from (say) node C, you would handle them inthe order
CB, CD, CH (since you are told they occur in alphabeticalorder).
[And
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured