Depth-First Search Dfs

Using recursion (implicitly using stacks)

Time Cost O (e+v)

input: figure G, starting point start (int)

Algorithm Process DFS (G, start)

1. Access the start node, color[start]=visited

2. Previsit (); Before the child node is accessed, the start node is processed, such as print

3. Loop, for each vertex adjacent to the start V, if Color[v]==unvisited,dfs (g,v)

4. Postvisit (); After deep access to its child nodes, the start node is processed, such as print (the processing here, can be used to sort the topology)

Depth-First Search Dfs