摘要
基于对Bellm an算法的改进,得到了求解k th最短路的新算法.改进算法的优势在于从Bellm an算法只能解决最短路问题拓展到求解k th最短路问题,而且可以考虑权重为负数的情况.与传统算法相比,新算法更易于理解.
Based on the Bellman algorithm, we make an improvement to get a new algorithm of solving the kth shortest path problem. The advantage of this method is expanding the coverage of Bellman algorithm from solving the shortest path to the kth-shortest path, and taking the minus weight value into account. Furthermore, the new algorithm itself is not far to seek, comparing with the traditional one.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第1期215-219,共5页
Mathematics in Practice and Theory
