求网的S-不变量的一种图算法

A Graph Algorithm to Find S-invariant of a Net

本文提出了一种新的求解网的S-不变量的方法。这种方法的基本思路是把一个网看作一个有向图,通过寻找网N的S-封闭基本有向贯通路簇或S-封闭基本有向回路簇,可以得到封闭重数方程组,求此封闭重数方程组的解就得到此网N的所有极小S-不变量。

A new method to find S-invariant for a net is presented in this paper. The basic idea of this method is to regard a net as a directed graph. By searching for S-closured basic directed transfixion path clusters or S-closured basic directed circuit clusters of a net we can deserve the closured repetitive-degree equation systems, from which we can get all S-invariants of the net.