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

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.

Project Supported:

Clc Number:

O157.5