(1）以图中顶点表示学校各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。（2）为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。-(1) to map the vertex school sites, storage attractions names, code names, profiles and other information; Edge said the path to the storage path length r

迪杰斯特拉算法，用于实现查找两点间的最短路径-Dijkstra algorithm for finding the shortest path between two points to achieve the