1、深度优先搜索遍历图的算法：首先访问指定的起始顶点V0，从V0出发，访问V0的一个未被访问过的邻接顶点W1，再从W1出发，访问W1的一个未被访问过的顶点W2，然后从W2出发，访问W2的一个未被访问过邻接顶点W3，依次类推，直到一个所有邻接点都被访问过为止。-1, depth-first search graph traversal algorithm: First visit to the designated start vertex V0, starting from V0, V0 a visit has not been visited adjacent vertex W1, starting from W1, W1, a visit has not been visited vertex of W2, and then starting from W2, W2 visit to a vertex not yet visited adjacent to W3, and so on, until all adjacent to a point have been visited so far.