（1）在经典的Dijkstra算法中，每查找一点需要重新比较和修改所有

（1）在经典的Dijkstra算法中，每查找一点需要重新比较和修改所有的 中的结点，浪费了大量的时间。对于海量数据的查询来说，等待的时间让人难于忍受；

結果 (英文) 1:

(1) in the classic the Dijkstra algorithm, every search need to compare and modify all the nodes, wasting a lot of time. For huge amounts of data for queries, waiting for the time to make it difficult for people to endure;

結果 (英文) 2:

(1) In the classical Dijkstra algorithm, each need to find a little compare and modify all of the nodes, wasting a lot of time. For query massive data, time makes it difficult to endure the waiting;

結果 (英文) 3:

(1) in the classic Dijkstra algorithm, each find a little need to compare and modify all the nodes, waste a lot of time. For querying massive data, the waiting time to let people intolerable;