（2）Dijkstra算法必须完全遍历每一个点；（3）这种邻接矩阵的空

（2）Dijkstra算法必须完全遍历每一个点；
（3）这种邻接矩阵的空间存储方式，使得在路径查找的时候也浪费了大量的空间，因为它要记录所有的结点的信息。

結果 (英文) 1:

(2) the Dijkstra algorithm must be completely traversed every point;(3) this form of adjacency matrix of space for storage, making searches also waste a lot of space, because it needs to record information for all nodes.

結果 (英文) 2:

(2) Dijkstra algorithm must be completely through each point;
Space Storage (3) of this adjacency matrix, making the path to find, they also waste a lot of space, because it wants to record information about all the nodes.

結果 (英文) 3:

(2) the Dijkstra algorithm must be completely through every point;
(3) this way of adjacency matrix storage space, so when in the path search also waste a lot of space, because it must record all the node information.