求翻译：假设S为已求得最短路径的终点的集合，则可证明：下一条最短路径(设其终点用户为x)或者是路线(i，x)，或者是中间只经过S中的顶点而最后到达用户X的路径。这可用反证法来证明。假设此路径上有一个顶点不在s中，则说明存在一条是什么意思？

Suppose S is the shortest path has been obtained by the end of the set, you can prove that: the next shortest path (set up its end users x) or route (i, x), or only after the middle of the vertices in S to reach the final User X's path. This can be reductio ad absurdum to prove. Suppose there is a v

S assumptions have been obtained for the shortest path to the finish line will prove a collection: The next section (located the shortest path to its destination X users (i) or a line, X), or a middle S only after the peak in the path of X users finally arrived. This can be used to prove the contrar

正在翻译，请等待...

Suppose that s is the collection has been seeking the end of the shortest path, you can prove that the next shortest paths (at its end users for x) or route (i,x), or only after the s in the vertex and the last in the middle path to reach the user x. This absurdity can be used to prove it. Assume th

Suppose S is the shortest path has been obtained by the end of the set, you can prove that: the next shortest path (set up its end users x) or route (i, x), or only after the middle of the vertices in S to reach the final User X's path. This can be reductio ad absurdum to prove. Suppose there is a v