%0 Journal Article
%T Fast low-cost shortest path tree algorithm based on ordinal circularly double linked list<br>基于有序双循环链表的低代价最短路径树快速算法
%A WANG Wei-qing
%A WANG Wei-hua
%A ZHANG Ming-yi
%A <br>汪维清
%A 汪维华
%A 张明义
%J 计算机应用
%D 2007
%I 
%X Low-cost shortest path tree is a commonly-used multicast tree type. On the foundation of the Fast Low-cost Shortest Path Tree (FLSPT) algorithm, the ordinal circularly linked list was selected as the calculating and saving center of sequence Q of nodes which were waiting for development. The fast low-cost shortest path tree algorithm based on ordinal circularly double linked list named Fast Low-cost Shortest Path Tree (DKFLSPT) was put forward. The shortest path tree constructed by DKFLSPT algorithm is the same as that constructed by FLSPT algorithm, making use of the part principle of ordinal circularly double linked list to improve the search procedure which can get the shortest path of nodes. The imitated experiment of random network indicates that the efficiency of DKFLSPT algorithm can be raised by 19%.
%K ordinal circularly double linked list
%K Shortest Path Tree (SPT)
%K Minimum Spanning Tree (MST)
%K part principle<br>有序双循环链表
%K 最短路径树
%K 最小生成树
%K 局部性原理
%K 有序
%K 循环链表
%K 低代价
%K 最短路径树
%K 快速算法
%K list
%K linked
%K double
%K circularly
%K based
%K algorithm
%K tree
%K shortest
%K path
%K 算法效率
%K 仿真结果
%K 随机网络模型
%K 搜索过程
%K 最小值
%K 节点路径
%K 改进
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD27430512CA3B7053100FE231&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=5D311CA918CA9A03&sid=E56875464B1C0EC1&eid=A7F20A391020FDEE&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=10