Page 291, Exercise 10

The results of applying the depth first and breadth first
search to the complete graph with four vertices are identical. 
The paths taken depend only on the order in which the vertices are
entered into the adjacency lists.  Assuming that the adjacency
lists have the following structure, the DFS and BFS will be 0, 1, 2, 3.

 
 ADJACENCY LIST

 0 -> 1 -> 2 -> 3 -> NULL
 1 -> 2 -> 3 -> 0 -> NULL

 2 -> 3 -> 1 -> 0 -> NULL

 3 -> 2 -> 1 -> 0 -> NULL