基于广度优先的最小独立闭合环搜索及其实现  

Minimum Independent Closed Loop Search Based on Breadth-First Search Algorithm and its Implementation

作　　者：夏先勤 XIA Xian-qin(School of Spatial Information and Surveying and Mapping Engineering,Anhui University of Science and Technology,Huainan 232001 China)

机构地区：[1]安徽理工大学空间信息与测绘工程学院,安徽淮南232001

出　　处：《科技创新与生产力》2021年第8期89-91,共3页Sci-tech Innovation and Productivity

摘　　要：针对最小独立闭合环自动搜索的问题,基于广度优先搜索的理论,本文首先讨论了广度优先搜索算法,然后在此基础上提出了基于广度优先的最小独立闭合环搜索算法,最后针对某些特殊情况下可能会遗漏最小独立闭合环的问题,在基于广度优先的最小独立闭合环搜索中嵌入"深度搜索"的过程。实例验证结果表明本文采用的算法具有较好的可行性。Aiming at the problem of minimum independent closed loop automatic search,this paper discusses the breadth-first search algorithm,and puts forward the minimum independent closed loop search algorithm based on breadth-first search algorithm.In order to solve the problem that the minimum independent closed loop may be omitted in some special cases,the process of depth search is embedded and the results show that the algorithm is feasible.

关 键 词：最小独立闭合环 广度优先 深度搜索 水准网 PYTHON 

分 类 号：P207[天文地球—测绘科学与技术]