Dijkstra算法的研究对象是赋权有向图（图用加权矩阵表示）的单源最短路径问题。可以求出任意节点到其他所有节点的最短距离。-The research object is the Dijkstra algorithm of weighted directed graph ( graph with weighted matrix) of single source shortest path problem. Can be obtained any node to all other nodes