出了一个 求解第 k短路径的算法 ，和其它 求解第 k短路径 的

算法相比，本算法具有较好的时间和空间复杂度。经性能分析 可知 ，本算法的时间复杂度和 Dijkstra算法相 当．空间复杂度

与顶点数具有线性关系。 -Solving the first k out of a short path algorithm, and other short-path k-solving algorithm, this algorithm has better time and space complexity. The performance analysis shows that the time complexity of this algorithm and the Dijkstra algorithm. Space complexity of a linear relationship with the top points.