Updating discovery/finishing times and parent nodes using a depth-first-search algorithm which traverses an adjacency list

Question

I am currently trying to write an algorithm which runs a depth first search by traversing through an adjacency list which holds the vertices and edges of a directed graph. W