图的遍历中，因为图的任一顶点都可能与其余的顶点相邻接，所以在访问了某个顶点之后，可能沿着某条路径搜索之后又回到该顶点上。为了避免同一顶点被访问多次，在遍历图的过程中必须记下每个已访问过的顶点。深度优先搜索从图的某个顶v点出发,访问此顶点，然后依次从v的未被访问的邻接点出发深度优先遍历图。遍历图的过程实质上是对每个顶点查找其邻接点的过程。其耗费的时间则取决于所采用的存储结构。-Graph traversal, since the graph of any vertex can be with the rest of the vertices adjacent, so a visit to a vertex, you may search along a particular path then back to the vertices. In order to avoid the same vertex have been visited many times, in the process of traversal map must note each vertex visited. Depth-first search from a map of a top-v point of view, access to this vertex, to be followed by visits from v are not adjacent to the point of depth-first traversal Fig. Ergodic map is essentially the process of search for each vertex the course of its adjacent points. Their time spent will depend on the used storage structure.