Answer Happy

3. Show the depth-first spanning forest (similar to that in
Figure 9.77) that results from
running depth-first search on graph G assuming the edges are
unweighted. Be sure to show
tree edges as solid arrows and forward/back/cross edges as dashed
arrows. When there is a
choice as to which vertex to visit next, always prefer the
lower-numbered vertex.
2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2.