undefined

DFS(G) 1 for each vertex u E G.V u.color = WHITE U = NIL 4 time = 0 5 for each vertex u E G.V 6 if u.color == WHITE 7 DFS-VISIT (G) DFS-VISIT(G, 1 time = time + 1 2 u.d = time 3 u.color = GRAY 4 for each v E G. Adj[u] 5 if v.color == WHITE 6 V. = U 7 DFS-VISIT(G,V) 8 u.color = BLACK 9 time = time +1 10 u.f = time This question is about tracing Depth-First Search (DFS) algorithm. The objective is to find out the order in which vertices are discovered (i.e., set gray). Consider this graph G = (V,E) below. Consider draw it on paper: it may help you. Consider drawing the resulting tree(s). ab,e ba, e, c, d cb,d |db, e, c ed, a, b Trace DFS(G) using the adjacency-list above. Make sure you follow the order indicated by the adjacency-list. Match each vertex u on the left with its u.d timestamp (time when u turns gray). a 1 b 2