本课程设计的内容为“校园导航”，校园平面图中取大学的11个常去地点，其略图如图1,图中已标出主要路线，各路线的长度如表１中所示。任务定义：找出从任意场所到达另一场所的最佳路径（最短路径）。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离，然后用Ｄijkstra求出最短路径。-The content of the curriculum design for the " Campus Map"　plan of the campus from the University of locations frequented by 11, the sketch map in Figure 1, the figure has marked the main line, the length of the line as shown in Table 1. The definition of tasks: to find out from any place to another place to reach the best path (shortest path). To solve this problem is obviously the word " adjacency matrix"　to store the distance between the points, and then find the shortest path with Dijkstra.