The Application of Minimum Spanning Tree Algorithm in the Water Supply Network

DOI

10.2991/iiicec-15.2015.13How to use a DOI?

Keywords

water supply network; mathematical model; minimum spanning tree; Kruskal algorithm

Abstract

The system of urban water supply network is the important lifeline project of the city. With the continuous development of social economy, people are no longer satisfied withwater supply requirements, but to put forward higher requirements for the safety, reliability and economy of the water supply. Based on actual demands to solve the economic problems of water supply network to ensurethe lowest costs in the laying the pipelines. First, establishing a mathematical model of water supply network, so we can usethe knowledge of graph theory to solve this problem; from the above that, the minimum spanning tree was needed to establish to ensure that costs are the lowest in the case of pipeline connectivity. Then using the Kruskal algorithm to generate minimum spanning tree; finally, an example was analyzedto verify its practicality, and thealgorithm solved the problem of water supply network in laying pipelines successfully.

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  - Fengxia Cong
AU  - Ying Zhao
PY  - 2015/03
DA  - 2015/03
TI  - The Application of Minimum Spanning Tree Algorithm in the Water Supply Network
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 52
EP  - 55
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.13
DO  - 10.2991/iiicec-15.2015.13
ID  - Cong2015/03
ER  -