CPⅢ高程网最小独立闭合环的一种搜索算法

Searching Algorithm of the Independence Minimal Closed Loop in CPⅢ Elevation Control Net

水准测量结束后,对观测成果进行往返较差、附合路线及闭合环的闭合差检查是必不可少的工作。CPⅢ高程控制网网形独特,它部分边含有往返测或双次观测且属于大型控制网(观测边可能含有数千条)。根据最小独立闭合环及最小独立附合路线的限制条件,依据CPⅢ高程控制网的特点,利用Dijkstra算法思想,提出了最小路径搜索法并进行编程实现,通过算例验证了其正确性和高效性。

After the end of leveling survey, misclosure checking about the observed results of round trip difference, annexed line, closed loop is essential. CPⅢ vertical control network form a unique network, part of its edges contain round trip measured and double observations, and it is a large control network (the observation side may contain thousands). According to the constraints of the smallest independent closed loop and the smallest independent annexed line, taking into account the characteristics of the CPⅢ vertical control network, and using the idea of the Dijkstra algorithm, this paper proposed the minimum path search method and achieved it by writing a program. In this paper, an example proved its correctness and efficiency.