|
|||||
|
|
| 基于剪枝的最小生成树算法在供水管网的应用 | |
| 引用本文： | 毛华,谢利伟,张智星.基于剪枝的最小生成树算法在供水管网的应用[J].计算机应用与软件,2011,28(2). |
| 作者姓名： | 毛华 谢利伟 张智星 |
| 作者单位： | 1. 河北大学数学与计算机学院,河北,保定,071002 2. 河北省数学研究中心,河北,石家庄,050016 3. 河北省机器学习与计算智能重点实验室,河北,保定,071002 |
| 基金项目： | 河北省自然科学基金数学专项基金(08M005) |
| 摘 要： | 在进行供水管网网络设计时,如何使铺设的供水管网线路最短,构建的供水管网造价最低是设计者需要重点考虑的问题之一。文章就此问题提出了一种基于剪枝的最小生成树算法。算法首先将交叉点(街道的交汇处)和节点(用户)都视为图的顶点,然后求出最小生成树,最后再将最小生成树中以交叉点为末梢的枝叶剪掉。该算法简洁、快速、易于实现。对铺设公路,架设网线等一类网络问题也有实际的参考意义。 |
| 关 键 词： | 供水管网 交叉点 节点 度 |
APPLYING PRUNING-BASED MINIMUM SPANNING TREE ALGORITHM IN WATER SUPPLY NETWORKS |
|
| Mao Hua,Xie Liwei,Zhang Zhixing.APPLYING PRUNING-BASED MINIMUM SPANNING TREE ALGORITHM IN WATER SUPPLY NETWORKS[J].Computer Applications and Software,2011,28(2). | |
| Authors: | Mao Hua Xie Liwei Zhang Zhixing |
| Affiliation: | Mao Hua Xie Liwei Zhang Zhixing(College of Mathematics and Computer Science,Hebei University,Baoding 071002,Hebei,China) (Mathematics Research Center of Hebei Province,Shijiazhuang 050016,China)(Key Lab in Machine Learning and Intelligence Computational of Hebei Province,China) |
| Abstract: | When designing water supply networks,it is the problem to be emphatically considered by the designer that how to pave shortest lines of water supply networks with lowest cost.This paper presents a pruning-based minimum spanning tree algorithm for this problem.In this algorithm,the cross-points(road intersections) and nodes(users) are pointed out as vertices of a graph,and then the minimum spanning tree of this graph is to be solved.The final step is to prune the top vertices which are also the cross-points ... |
| Keywords: | Water supply network Cross-point Node Degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |