K shortest path problem finds the kth shortest path from the source node to the destination node. It’s known that the k shortest path problem is NP-complete. In this paper, we restrict the problem in Halin Networks and give an algorithm to find the kth shortest paths. The time complexity is O(k3|V|).
展开▼
机译：k最短路径问题从源节点到目标节点找到kth最短路径。众所周知，K最短路径问题是NP-Complete。在本文中，我们限制了哈林网络中的问题，并提供了一个算法查找kth最短路径。时间复杂性是O（k3 | v |）。
展开▼
