2011 | OriginalPaper | Buchkapitel
Realization of the Minimum Cost Spanning Tree’s Storage and Optimization in Prim Algorithm
verfasst von : Pan Da-zhi, Liu Zhi-bin, Chen You-jun, Ding Xian-feng
Erschienen in: Applied Informatics and Communication
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.