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 条
  • [1] Realization of the Minimum Cost Spanning Tree's Storage and Optimization in Prim Algorithm
    Pan Da-zhi
    Liu Zhi-bin
    Chen You-jun
    Ding Xian-feng
    APPLIED INFORMATICS AND COMMUNICATION, PT I, 2011, 224 : 424 - +
  • [2] The expected complexity of Prim's minimum spanning tree algorithm
    Martel, C
    INFORMATION PROCESSING LETTERS, 2002, 81 (04) : 197 - 201
  • [3] Relation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm
    Guttmann, Walter
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2016, 2016, 9965 : 51 - 68
  • [4] Comparative of prim's and boruvka's algorithm to solve minimum spanning tree problems
    Marpaung, F.
    Arnita
    6TH ANNUAL INTERNATIONAL SEMINAR ON TRENDS IN SCIENCE AND SCIENCE EDUCATION, 2020, 1462
  • [5] Clustering with Prim's sequential representation of minimum spanning tree
    Wang, Guan-Wei
    Zhang, Chun-Xia
    Zhuang, Jian
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 247 : 521 - 534
  • [6] DEVELOPMENT OF GIS TOOL FOR THE SOLUTION OF MINIMUM SPANNING TREE PROBLEM USING PRIM'S ALGORITHM
    Dutta, Suvajit
    Patra, Debasish
    Shankar, Hari
    Verma, Prabhakar Alok
    ISPRS TECHNICAL COMMISSION VIII SYMPOSIUM, 2014, 40-8 : 1105 - 1114
  • [7] THE DESIGN AND ANALYSIS OF ALGORITHM OF MINIMUM COST SPANNING TREE
    徐绪松
    刘大成
    吴丽华
    ActaMathematicaScientia, 1996, (03) : 296 - 301
  • [8] The design and analysis of algorithm of minimum cost spanning tree
    Xu, XS
    Liu, DC
    Wu, LH
    ACTA MATHEMATICA SCIENTIA, 1996, 16 (03) : 296 - 301
  • [9] The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Vidal-Puga, Juan
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1279 - 1283
  • [10] VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim Clustering Algorithm
    Kponyo, Jerry John
    Kuang, Yujun
    Zhang, Enzhan
    Domenic, Kamenyi
    2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL PROBLEM-SOLVING (ICCP), 2013, : 101 - 104
12345