论文部分内容阅读
由于利用Coates图分析线性电路求取数值解和符号解时其实用性取决于产生有向图的1-因子和1-因子连接。基于图的深度优先搜索,本文提出一种寻找1-因子和1-因子连接的高效算法,并编制了应用程序。
Due to the use of Coates graph analysis of linear circuits to obtain numerical solutions and symbolic solutions depends on the availability of the directional graph 1-factor and 1-factor connection. Based on graph-based depth-first search, this paper proposes an efficient algorithm to find 1-factor and 1-factor connections and compiles the application.