用邻接表表示图，重写Dijkstra算法，输入任意带权有向图，输出其每一对顶点之间的最短路径(A diagram showing the adjacency table, rewriting Dijkstra algorithm, with the right to enter any directed graph, the output of each of its shortest path between the vertices)