| 求有向图的1—因子和1—因子连接 |
| |
| 引用本文： | 唐治德 程形明. 求有向图的1—因子和1—因子连接[J]. 重庆大学学报(自然科学版), 1993, 16(6): 130-133 |
| |
| 作者姓名： | 唐治德 程形明 |
| |
| 作者单位： | 重庆大学电气工程系，重庆大学电气工程系 重庆 630044，重庆 630044 |
| |
| 摘 要： | 由于利用Ｃｏａｔｅｓ图分析线性电路求取数值解和符号解时其实时性取决于产生有向图的１－因子和１－因子连接。基于图的深度优先搜索，本文提出一种寻找１－因子和１－因子连接的高效算法，并编制了应用程序。
|
| 关 键 词： | 有向图 深度优先搜索 1因子连接 |
A Solution of 1-Factors and 1-Factorial Connections of a Digraph |
| |
| Tang Zhide Cheng Kaiming. A Solution of 1-Factors and 1-Factorial Connections of a Digraph[J]. Journal of Chongqing University(Natural Science Edition), 1993, 16(6): 130-133 |
| |
| Authors: | Tang Zhide Cheng Kaiming |
| |
| Affiliation: | Tang Zhide Cheng Kaiming |
| |
| Abstract: | 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. |
| |
| Keywords: | digraph 1-factor 1-factorial connection depth-first searching |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆大学学报(自然科学版)》下载全文 |
