引入方向因子的最小回路、最大回路搜索算法

提出了最小回路、最大回路和方向因子的概念，基于方向因子构造了最小回路、最大回路搜索算法。算法依据图论知识，建立改进后的无向图邻接矩阵，根据节点坐标确定搜索始点，将搜索边失量化，结合节点坐标求解邻接边的方向因子，按方向因子的大小可以快速确定搜索边，形成了无向图中最小回路、最大回路搜索算法。该算法每搜索一次都可以确定一条搜索边，通过生成退化图减小下一次搜索的搜索范围，提高了搜索速度，反映出较小的时间复杂度。根据该算法编制了相应的算法程序，成功解决了建筑工程量计算中的外墙壁和房间划分问题。

The Algorithm of Searching out the Least and Most Loops by Making Use of Direction Factor

Based upon the conception of the least loop,the most loop and direction factor presented by the author firstly,the algorithm of searching out the least and most loops has been designed.By building the adjoining matrix, confirming the start-point of searching,vectorizing the searching sides,calculating the direction factor of adjoining sides,we can search out the next side of the least loop or the most loop rapidly.With a valid searching side being confirmed at every searching and the searching scope being reduced by forming degenerate graph,the time compexity of the algorithm is much less. In the research of the automatic calculating system of construction quantities, the problem of houses partition and out-wall partition had been solved succesfully by utilizing this searching algorithm.