对于有向带权图中从一个确定结点到其余各结点的最短路径问题，狄克斯特拉斯提出按路径长度递增顺序逐步产生最短路径的算法构造。-　For the weighted graph from one node to determine the shortest path problem the rest of the nodes, Dicks Atlas raised gradually ascending order by the path length of the shortest path algorithm to generate construct.