从图中某个顶点出发访问图中所有顶点，且使得每一顶点仅被访问一次，这个过程称为图的遍历。图的遍历是从图中某个顶点出发，沿着某条搜索路径对图中其余每个顶点进行访问, 并且使图中的每个顶点仅被访问一次的过程。

图的遍历是图运算中最重要的运算,也是图的基本运算之一,图的许多运算都是以遍历为基础的。试编写一个程序，完成对图的遍历。-A vertex from the graph in Figure visit all vertices, and so each vertex is visited only once, a process known as graph traversal. Graph traversal is a vertex from the graph, a bar along the search path for the rest of the figure to visit each vertex and each vertex of the graph is accessed only once in the process. Graph traversal is the most important figure in the computing operation is one of the basic operations plans, operations plans are based on many based traversal. Try writing a program to complete the graph traversal.