求翻译：下面再求下一条长度次短的最短路径。假设该次短路径的用户是jk,则可想而知，这条路径或者是(i，jk)，或者是(i，jr ,jk)。它的长度或者是从i到jk的路线的权值，或者是D[r]和从jr到jk的路线的权值之和。是什么意思？

Next, find the next shortest path length of time short. Assuming that the second user is a short path jk, you can imagine, this path, or the (i, jk), or (i, jr, jk). Or is it the length of the route from i to jk the weight, or D [r] and from the line jk jr to the sum of the weights.

The next section below for further short of meeting the shortest path length. Assuming that the user is the shortest path JK, path, or one can imagine, this article is JK, (i) or (i, Jr, JK). Or is it the length from the JK I value, or the right of the route is D [r] and from JR to JK's line of valu

正在翻译，请等待...

Following again for the next short for the length of time of the shortest path. Users who assume the short path is JK, you can imagine, this path or (i,JK), or (i,Jr, JK). Its length or from level I to JK line weights, or D[r] and from JR to JK line, the sum of the weights.

Next, find the next shortest path length of time short. Assuming that the second user is a short path jk, you can imagine, this path, or the (i, jk), or (i, jr, jk). Or is it the length of the route from i to jk the weight, or D [r] and from the line jk jr to the sum of the weights.