Prim Algorithm Based on Heap for Finding Minimal Spanning Tree of Ventilation Network

Based on ventilation network graph is rooted directed weighted graph, its' nature of minimum spanning tree is proposed. According to the dense of ventilation network graph, introduces heap to improve the Prim algorithm, gives C++ implementation for the algorithm, and finally gains the Prim algorithm based on heap is both suitable for dense graph and sparse graph by analyzing its' time complexity, so the algorithm can meet the requirement to seek the minimum spanning tree of ventilation network graph.