实现功能：1,从文件读入景点信息道路信息，然后用邻接表建立校园图，用邻接矩阵存放边的信息。

2,查看景点信息，道路信息。

3,查找两点之间最短路径，采用弗洛依德算法。

4,采用深度优先递归调用的方法遍利图。-Functions: 1, read from the file into the attractions road information and the establishment of the campus map, and then use the adjacency list stored with adjacency matrix side of the information.

Two view points of interest information, road information.

3, find the shortest path between two points, using the Floyd algorithm.

4, using the depth-first recursive call to all over the benefit plans.