迪杰斯特拉算法用于求解一个有向图（也可以是无向图，无向图是有向图的一种特例）的一个点（称之为原点）到其余各点（称之为周边点）的最短路径问题。-Algorithm is used to a directed graph (can also be a undirected graph, undirected graph is a directed graph of a special case) of a point (called the origin) to the rest of the various points (called the perimeter points) of the shortest path problem