校园局域网布线和游历问题

任务 ：用无向网表示你所在学校的主要建筑平面图，图中顶点表示主要建筑，图中的边表示建筑之间的道路，存放路径长度信息。要求能够建立校园局域网，所花的代价最小；给出任意建筑之间游历的最短路径。基本要求：

（1） 原始数据存在文件中，方便读入；

（2） 建筑物点不小于20个，边不小于30个；

（3） 分别用广度优先和深度优先的方法遍历图，起始点定为1号教学楼；

（4） 建立校园局域网，要求所花的代价最小；

（5） 查询从1号教学楼到其他各点的最短路径；

（6） 查询图中任意两个建筑间的最短路径。-The campus LAN wiring and traveled tasks: undirected said your school floor plan, said the main building of vertices and edges in the graph represents a road between the buildings, storage path length information. Requires the ability to create a campus LAN spent minimal cost　given traveled the shortest path between any building. Basic requirements: (1) the original data file, easy read　(2) buildings not less than 20 points, the edge is not less than 30　(3), respectively, with the breadth-first and depth-first traversal Figure as a starting point for the 1st teaching building　(4) to establish a campus LAN, least costly requirements of the flower　(5) query teaching from the 1st floor to the other points of the shortest path　(6) any two buildings in the query graph The shortest path between.