Realization of the Minimum Cost Spanning Tree's Storage and Optimization in Prim Algorithm

被引：0
|
作者：
Pan Da-zhi [1 ,2 ]
Liu Zhi-bin [2 ]
Chen You-jun [1 ]
Ding Xian-feng [2 ]
机构：
[1] China West Normal Univ, Coll Math & Informat, Nanchong 637009, Peoples R China
[2] Southwest Petr Univ, Sch Sci, Chengdu 610050, Peoples R China
来源：
2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I | 2010年
关键词：
network; Prim Algorithm; minimum cost spanning tree; bi-directional circular linked list; static linked list;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper designs a special data structure for vertices in the network. the storage of edges in minimum cost spanning tree(for short, MCST) has been realized by the vertex array,which is created by the special data structure. Through the vertex array, the vertices in V-U set constitute a static bi-directional circular linked list, so Prim algorithm realizes truly operation selecting the shortest side though the V-U set, by which the Prim algorithm is optimized to improve the efficiency of the operation. For the same vertex lying in U and V-U at the different moments, the special data structure makes storage space to be fully used and improves space utilization..
引用
收藏
页码：240 / 243
页数：4
相关论文
共 50 条
  • [31] An algorithm for inverse minimum spanning tree problem
    Zhang, JH
    Xu, SJ
    Ma, ZF
    OPTIMIZATION METHODS & SOFTWARE, 1997, 8 (01): : 69 - 84
  • [32] Clustering Based Minimum Spanning Tree Algorithm
    Saxena, Sakshi
    Verma, Priyanka
    Rajpoot, Dharmveer Singh
    2017 TENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2017, : 360 - 362
  • [33] A parallel algorithm for minimum spanning tree on GPU
    de Alencar Vasconcellos, Jucele Franca
    Caceres, Edson Norberto
    Mongelli, Henrique
    Song, Siang Wun
    2017 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING WORKSHOPS (SBAC-PADW), 2017, : 67 - 72
  • [34] Minimum spanning tree partitioning algorithm for microaggregation
    Laszlo, M
    Mukherjee, S
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (07) : 902 - 911
  • [35] A simpler minimum spanning tree verification algorithm
    King, V
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 440 - 448
  • [36] A simpler minimum spanning tree verification algorithm
    King, V
    ALGORITHMICA, 1997, 18 (02) : 263 - 270
  • [37] Image registration with minimum spanning tree algorithm
    Ma, B
    Hero, A
    Gorman, J
    Michel, O
    2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL I, PROCEEDINGS, 2000, : 481 - 484
  • [38] A simpler minimum spanning tree verification algorithm
    V. King
    Algorithmica, 1997, 18 : 263 - 270
  • [39] Split Manipulations in Cost Sharing of Minimum Cost Spanning Tree
    Todo, Taiki
    Yokoo, Makoto
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 219 - 226
  • [40] Cost monotonicity, consistency and minimum cost spanning tree games
    Dutta, B
    Kar, A
    GAMES AND ECONOMIC BEHAVIOR, 2004, 48 (02) : 223 - 248
12345