深度优先搜索算法基本思想为，首先从图中某个节点出发, 然后依次从相邻的

The basic idea of ​​the depth-first search algorithm is to start from a certain node in the graph, and then start the depth-first traversal from the adjacent nodes in turn, until all the nodes in the graph that are connected with the path are visited. If any node has not been visited at this time, select one node as the starting point, and repeat the above process until all vertices are visited.

The basic idea of the depth first search algorithm is to start from a node in the graph, and then start from the adjacent nodes in turn. The depth first traversal is performed until all the nodes in the graph that are connected with the path are accessed. If there are nodes not accessed at this time, select one of them as the starting point and repeat the above process until all vertices are accessed.

The basic idea of the depth-first search algorithm is to start from a certain node in the graph, and then go through the depth-first traversal from the neighboring nodes in turn until all the nodes in the graph that are connected with the path are visited. If there are nodes that have not been visited in this fashion, select a node as the starting point and repeat the above process until all vertices have been visited.