(1)模拟设计学校的平面图，景点不少于10个，顶点表示校园内各景点，有关景点的信息包括名称、代号、简介等信息，边表示路径，存放路径长度。在计算机中表示该图；
(2)为来访客人提供图中任意景点相关信息的查询；
(3)为来访客人提供从某个起点到达任意景点的路径查询。
选择一种数据结构模拟此过程，编程实现基本要求。((1) simulate the design of the school plan, and the scenic spots are not less than 10. The vertices denote the scenic spots in the campus. The information about the scenic spots includes name, code number, introduction and so on. It represents the path and the length of the storage path. The graph is represented in a computer;
(2) to provide visitors with the information of any scenic spots in the map.
(3) to provide visitors with a path from a starting point to any scenic spot.
A data structure is selected to simulate the process, and the basic requirements of programming are realized.)