说明：  设图的顶点大于1个，不超过30个，每个顶点用一个编号表示（如果一个图有n个顶点，则它们的编号分别为0, 1, 2, 3, …, n-1）。 此题为求有向网中顶点间最短路径问题，可建立以票价为权的邻接矩阵，用Dijkstra算法求最短路径长度。 Dijkstra算法中有一个辅助向量D，表示当前所找到的从源点到其它点的最短路径长度。因为每次都要在D中找最小值，为提高性能，用最小值堆的优先队列存储D值。
(Let the vertex is greater than 1, no more than 30, with a number that each vertex (if a graph with n vertices, their numbers are 0, 1, 2, 3, ..., n-1). This network entitled to seek a shortest path between vertices, we can establish the right of the fare for the adjacency matrix, using Dijkstra' s algorithm for the shortest path length. Dijkstra' s algorithm has an auxiliary vector D, the found that the current from the source point to the other points of the shortest path length. Because every time to find the minimum value in the D, to improve performance, with the minimum heap priority queue storage D values.)