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

DOI

10.2991/asei-15.2015.273How to use a DOI?

Keywords

ventilation network; minimum spanning tree; directed weighted graph; heap; Prim algorithm.

Abstract

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.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Buchuan Wang
AU  - Qinglong Liu
AU  - Wenbin Wu
PY  - 2015/05
DA  - 2015/05
TI  - Prim Algorithm Based on Heap for Finding Minimal Spanning Tree of Ventilation Network
BT  - Proceedings of the 2015 International conference on Applied Science and Engineering Innovation
PB  - Atlantis Press
SP  - 1381
EP  - 1386
SN  - 2352-5401
UR  - https://doi.org/10.2991/asei-15.2015.273
DO  - 10.2991/asei-15.2015.273
ID  - Wang2015/05
ER  -