摘要
通过比较已有的Dijkstra算法和基于四叉堆优先级队列的Dijkstra算法的时间复杂度得出,后者的执行效率高于前者;并在此基础上提出了基于四叉堆优先级队列的OSPF算法,以提高OSPF的效率。
It is concluded that the efficiency of quadheap PRI queue is higher than old Dijkstra by comparing their asymptotic time complexity. In order to improve the efficiency of OSPF, this paper put forward an OSPF algorithm which is based on quadheap PRI queue.
出处
《太原理工大学学报》
CAS
2004年第4期480-482,共3页
Journal of Taiyuan University of Technology
关键词
路由选择
OSPF
四叉堆
routing
open shortest-path first(OSPF)
quadheap
