说明：  输入或存储任意一个无向图，显示图的深度优先搜索遍历路径和广度优先搜索遍历路径。 要求： 1）基于图的邻接表存储结构实现。 2）基于图的邻接矩阵存储结构实现。
(Input or store any undirected graph to show the depth first search traversal path and breadth first search traversal path of the graph Requirement 1 the implementation of the adjacency table storage structure based on the graph 2 the implementation of the adjacency matrix storage structure based on the graph)