本程序实现了《数据结构》课本中无向图的基本算法，包括图的构造、图的深度、广度优先遍历算法、用Prim、Kruskal算法构造最小生成树以及分别用Dijkstra、Floyd算法求源点到所有顶点、图中任意两点间的最短路径，并给出具体的路径 -This procedure achieved a " data structure"　textbooks undirected graph the basic algorithm, including graphs, graph depth, breadth-first traversal algorithm, Prim, Kruskal minimum spanning tree construction algorithm and were used Dijkstra, Floyd algorithm to solve the source to all vertices of the graph the shortest path between any two points, and gives a specific path