说明：  图的数据结构相关实验，包括无向图的创建及图的BFS,DFS深度遍历，可进行最短路径的算法有最小生成树
(It includes the creation of an undirected graph and the BFS, DFS depth traversal of the graph, and the shortest path algorithm has the minimum spanning tree)