Below is the depth-first search (DFS) algorithm for graphs:

Using the DFS algorithm, navigate from the starting node in the diagram below. At the end of the navigation process, write the discovery (discover) and finish (finish) times of each node next to the nodes.

DFS (G, S) 01 for each vertex u E G.V() 02 u.setcolor (white) 03 u.setparent (NIL) 04 time to 05 for each vertex u E G.VO) 06 if v.color() = white then DFS-Visit(v) = DFS-Visit(u) 01 u.setcolor (gray) 02 time time + 1 03 u.setd(time) 04 for each v eu.adjacent() 05 if v.color() white then 06 v.setparent(u) 07 DFS-Visit(v) 08 u.setcolor (black) 09 time time + 1 10 u.setf(time) = A B D E F G H