Fast low-cost shortest path tree algorithm based on ordinal circularly double linked list
基于有序双循环链表的低代价最短路径树快速算法

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%.