对于一个给定的任意边数和顶点值的有向图或无向图，用邻接表存储,并用深度优先搜索算法实现对图的遍历。 -For a given arbitrary value of edges and vertices of the directed graph or undirected graph, with adjacency table storage, and depth-first search algorithm for graph t