Realization of the minimum cost spanning tree's storage and optimization in Prim algorithm

Abstract

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. © 2011 Springer-Verlag.