Dijkstra算法是一种基于贪心策略的最短路算法，它的主要思想是按照

Dijkstra算法是一种基于贪心策略的最短路算法，它的主要思想是按照路径长度逐点增长的方法构造一棵路径树，从而得到从该树的根节点（即指定起点）到其他所有节点的最短路。

結果 (英文) 1:

Dijkstra algorithm is a shortest path algorithm based on greedy method, whose main idea is to follow the path length method constructs a tree of point-by-point growth, resulting from the root node of the tree (that is, specifying the starting point) to all other nodes of the shortest path.

結果 (英文) 2:

Dijkstra algorithm is a greedy strategy based on shortest path algorithm, its main idea is to construct a tree path tree path length in accordance with the growth-by-point method, resulting from the root of the tree (ie, the designated starting point) to all other nodes most shorted.

結果 (英文) 3:

Dijkstra algorithm is a shortest path algorithm based on greedy strategy, its main idea is in accordance with the construction method of path length pointwise growth a path tree, which is obtained from the root node of the tree (i.e., specify the starting point) to all other nodes of the shortest path.