控制网最小独立闭合环搜索算法研究

Search Algorithms for Least Independent Close Loops

论述了控制网中最小独立闭合环搜索的两种算法:基于生成树的算法和基于迭代加深搜索的算法,在理论上进行了推导,并结合实际算例,对两种算法进行了比较,得出了在某些情况下,后一种算法搜索结果不是太稳定,前一种算法搜索结果稳定的结论。

This article elaborated two algorithms by which the smallest independent closure loops are searched in the control network. Based on the spanning tree algorithm and based on the iterative deepening search algorithm, has theoretically carried on the inferential reasoning, and unifies the actual example, has carried on the comparison to two algorithms, has obtained in certain situations, the latter algorithm search result is not too stable, preceding algorithm search result stable conclusion.