说明：  以邻接表为存储结构实现求从源点到其余各顶点的最短路径的Diijkstra算法-Dijkstra，已通过测试。
(Adjacency list, ask the rest of the vertices of the shortest path from source to the storage structure Diijkstra algorithm-Dijkstra, has been tested.)