遍历算法在数据结构中是最普通的运算方法也是所有其它算法的基础。由于图的遍历比线性表、树的结构的遍历算法要复杂,因此着重对图的遍历算法进行讨论, 具有更普遍的意义。图的遍历就是从图中指定的某顶点作为遍历的起始出发点, 按照一定搜索遍历路径, 对图中所有顶点仅作一次访问的过程。

根据搜索路径方向的不同, 遍历图的方法可分深度优先搜索遍历和广度优先搜索遍历, 又根据编制算法的方法不同, 可分为递归遍历算法和非递归遍历算法。

-Data structure traversal algorithm is the most common method of operation is the basis for all other algorithms. Traverse the graph than the linear form, the structure of the tree traversal algorithm to complex, focusing on the discussion of graph traversal algorithms, a more general significance. Graph traversal is from a specified vertex graph traversal starting as a starting point, according to a certain search path traversal, all vertices of the graph for a visit only the process. Under the direction of the search path is different graph traversal methods can be divided into depth-first search traversal and breadth-first search traversal, but also according to different methods of preparation method, can be divided into non-recursive traversal algorithms and recursive traversal algorithms.