那么下一条最短路径（终点为 ），或者是 ，或者是 。一般情况下，假设

那么下一条最短路径（终点为 ），或者是 ，或者是 。一般情况下，假设 是存放己经求出的最短路径的终点的集合，那么下一条最短路径的中间节点，其长度为

結果 (英文) 1:

Then the next shortest path (destination), or, or. Under normal circumstances, assumptions are kept has been calculated the shortest path to the end of the collection, then the next shortest path between nodes and the length of

結果 (英文) 2:

Then the next one shortest path (end point), or yes, or yes. In general, the assumption is that the end of the already stored set of calculated shortest path, then the intermediate node in the shortest path, the length of

結果 (英文) 3:

Then the next shortest paths (end point was, or is, or is). In general, the assumption is a collection of shortest path storage has been calculated end point, then the next shortest paths of the intermediate node, its length is