生成树算法在最小独立闭合环搜索中的应用

The Application of Least Closed Loops Searching Algorithm Based on Spanning Tree in Leveling Network

基于水准网的特点,结合广度优先遍历的思想,实现了生成树算法,并简化了Dijkstra算法在水准网中搜索最短路径时的应用,提高了计算效率。

Based on breadth-first search,spanning tree algo rithm is used in the least closed loops searching.And them Dijkstra algorithm is simplified at the same time.The result shows the computation efficiency is improved.