迪杰斯特拉算法主要是采用了一个dist一维数组，来存储源点到其它顶点的最短路径，然后不断更新。-Dijkstra algorithm is used mainly in a dist one-dimensional array to store the point vertices of the shortest path to other sources, and constantly updated.