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.
This work is partially supported by Scientific Research Fund of Sichuan Education Department (10ZB018).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yan, W.M., Wu, W.M.: Data Structure. Tsinghua University Press, Beijing (2001)
Sun, Q., Sheng, J.H., Gu, Z.J.: Algorithm for Finding All the Shortest Paths from One Node to Another in A Graph. Computer Engineering 28(2), 134–136 (2002)
Hou, L.P., Li, W.S.: Minimum Spanning Tree Algorithm Based on Extended Double List Storage Structure. Journal of Beijing Jiaotong University 27(2), 93–95 (2003)
Wan, K.X., Enslow, H., Pan, Q.J.: the New Algorithm of CMST Problem. Chinese Journal of Computers 14(9), 34–37 (1991)
Lai, W.G., Li, O., Cheng, J.: A Novel Genetic Algorithm for Degree Constrained Minimum Spanning Tree Problem. Computer Simulation 25(8), 162–165 (2008)
Li, H.B., Chen, J.: Dynamic optimum of minimum span tree’s algorithm devised by Prim. Computer Engineering and Applications 43(12), 69–73 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Da-zhi, P., Zhi-bin, L., You-jun, C., Xian-feng, D. (2011). Realization of the Minimum Cost Spanning Tree’s Storage and Optimization in Prim Algorithm. In: Zeng, D. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23214-5_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-23214-5_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23213-8
Online ISBN: 978-3-642-23214-5
eBook Packages: Computer ScienceComputer Science (R0)