Discussion on searching algorithm of least independent loops and leveling branch line
Zhu Wenw · Cehui kexue · 2016
Aiming at the problem that the searching of least independent loops by existed depth-first algorithm is probably incorrect due to some twisty leveling lines,the paper proposed an improved searching algorithm of least independent loops:through introducing the plane coordinate data,the algorithm which comes from step back substitution idea could precisely search the least independent loops in the leveling network;moreover,considering branch lines probably existed in the network,the algorithm could extract the information of branch lines.Experimental result showed that the proposed algorithm would improve the searching accuracy and find out the leveling branch lines,which make the leveling network joint works more convenient and reliable.