求翻译：但是，这是不可能的。因为该算法是按路径长度递增的次序来产生各最短路径的，故长度比此路径短的所有路径均已产生，它们的终点必定在S中，即假设不成立。是什么意思？

However, this is not possible. Because the algorithm is based on the order of increasing path length to generate the shortest path, so the path length shorter than this all the paths are generated, they must end in S, that assumption does not hold.

However, this is not possible. Because the algorithm is based on the sequence increments path length to generate the shortest path, so this is the path length shorter than that of all paths have been generated, they must in the end, that is, assuming that is not established in S.

But, this is not impossible.Because this algorithm is the order which increases progressively according to the way length produces each most short-path, therefore the length has produced compared to this way short all ways, their end point in S, namely the supposition is surely untenable.

However, this is not possible. Because the algorithm is based on order to produce the shortest path to the path length increases, so length shorter than the path of all the paths have been produced, they end in s, that is, if not set up.

null