摘要
借助于“背离”路径的概念,论文在2nd最短路径搜索算法的基础上提出了一种新的Kth最短路径搜索算法,并将其应用至实际环境中。通过K-1次2nd最短路径搜索算法的迭代,该算法可以求出网络中任意两个给定节点之间的Kth最短路径,2nd最短路径搜索算法在计算上具有简单性,因而也同样具有简洁、快速的特点。
We describe a new algorithm to figure out the Kth shortest simple(loopless)path in a undirected graph and report on its implementation.Our algorithm is based on 2nd shortest path algorithm and ″deviation path″.By K-1 times iteration of 2nd shortest path algorithm,we can finally find the Kth shortest path between two nodes assigned conveniently and quickly.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第30期49-50,89,共3页
Computer Engineering and Applications
