求有向图的1-因子和1-因子连接

A Solution of 1-Factors and 1-Factorial Connections of a Digraph

由于利用Coates图分析线性电路求取数值解和符号解时其实用性取决于产生有向图的1-因子和1-因子连接。基于图的深度优先搜索,本文提出一种寻找1-因子和1-因子连接的高效算法,并编制了应用程序。

One can get the digital solutions and the symbolic solutions of linear circuits in the same time by using coates graph. However, the practicability of the method depends on the effeciency of generation of 1-factors and 1-factorial connections. Based on the way of depth first searching,an algorithm was presented here for solving all 1-factors and 1-factorial connections. And a proctical programm has been compiled.