Question 2 options:

Consider the adjacency list representation of a graph with 8 vertices and 10 edges: 0: 1 1: 0 2 4 5 2: 1 6 5 3 3: 6 2 4: 1 5 5: 1 4 2 6: 3 7 2 7: 6 Here is a graphical representation of the same graph: (0)-------------(1)-------------(2)-------------(3) /| /| / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / | / | / / |/ |/ (4)-------------(5) (6)-------------(7) Run depth first search from vertex 6 and calculate the values of the edgeTo[] array. Match the edgeTo[] array elements with their calculated values. 

Note that edgeTo[6] is not included since it is not assigned for a new DepthFirstPaths(G, 6) instance with source vertex 6. Be sure to use the order from the adjacency list! 

edgeTo[0]:

edgeTo[1]:

edgeTo[2]:

edgeTo[3]:

edgeTo[4]

edgeTo[5]:

edgeTo[7]: