Advertisement
Published in:
2011 | OriginalPaper | Chapter
Realization of the Minimum Cost Spanning Tree’s Storage and Optimization in Prim Algorithm
Authors : Pan Da-zhi, Liu Zhi-bin, Chen You-jun, Ding Xian-feng
Published in: Applied Informatics and Communication
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.