2-25 "AHA Algorithm" 5th chapter, the graph of the ergodic principle.

The first section, depth and breadth first refers to what

For the traversal of the graph.

The main idea of depth-first traversal is to traverse one of the branches of the graph until the end, then back up, and then do the same traversal along another line until all the vertices have been accessed.

The main idea of breadth-first traversal is to first access all of its adjacent vertices with an unused vertex, and then to each adjacent vertex, and then access their adjacent, inaccessible vertices until all the vertices have been accessed and the traversal ends.

2-25 "AHA Algorithm" 5th chapter, the graph of the ergodic principle.