第k短路径研究论文，有经过中间节点情况，可以是固定顺序，也可以非固定-k-shortest path research papers, there are cases through intermediate nodes, which can be fixed sequence to be non-fixed

使用蛙跳算法，对第k短路径问题进行研究，包含经过中间节点的情况，可以是固定顺序也可以不固定顺序。-Use leapfrog algorithm, k-shortest path problem studied, including the case through an intermediate node, which can be fixed to be the order of the order is not fixed.