An Algorithm to Find the kth Shortest Path in Halin Networks

K shortest path problem finds the kth shortest path from the source node to the destination node. Itpsilas 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(k³|V|).