Data Structures, Algorithms, & Applications in C++
Chapter 16, Exercise 41

(a)

The linked adjacency-lists are

(b)

In a breadth-first search the vertices are visited in the order 4,3,5,7,2,6,1

(c)

The sub graph is shown below.

(d)

The depth-first order is 4,3,2,1,6,5,7, and the sub graph is shown below.