基于堆的无向带权图最小生成树的PRIM方法

A Prim Method Based on Heap for Finding Minimal Spanning Tree of Undirected Weighted Graph

通过引用堆的思想,达到了在选最小边时能充分使用原有比较信息的目的,对PRIM算法进行了探讨。

The paper,applying the concept of heap,explores the PRIM algorithms.And heap can serve the purpose of making full use of the original compared information while choosing the minimal edge next time.