摘要
提出了求受顶点数限制的最短路径问题的一个算法,与现有的算法相比,该算法效率较高,时间复杂度为(O(k-2)n2)(k是受限制的顶点数,n是图中顶点总数);而且该算法比较简单,易于描述、实现和理解。
In this paper, an algorithm for vertices-constrained shortest path is put forward. Compared with a present algorithm, the (efficiency of this algorithm is high and its time complexity is O(k-2)n2)(n is the number of vertices in a graph, k is the constrained number of vertices). Another characteristic of this algorithm is that it is very simple and very easy to be described,fulfilled and understood .
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第9期73-74,共2页
Computer Engineering
