说明：  Dijsktra算法，图论中的基础算法，用来求网络图中始发点到各个点的最短路，并给出权值
(Dijsktra algorithms. in graph theory of the basic algorithm that is used to ask the network diagram to the point of the short, and gives to)