由矩阵构造的DFS算法求图的全部树 |
| |
引用本文: | 张耀东,关亚东.由矩阵构造的DFS算法求图的全部树[J].吉林化工学院学报,1986(1). |
| |
作者姓名: | 张耀东 关亚东 |
| |
作者单位: | 吉林化工学院图书馆,吉林化工学院化机系 |
| |
摘 要: | 本算法可直接由图生成所有因式乘积表达式。当将任一表达式展开,每一乘积项都是树。从而达到了由图直接、无重复、成批产生全部树的目的。
|
关 键 词: | 图论算法 树(数学) |
All Trees of the Chart Resulted from DFS Algorithm Formed of Matrixes |
| |
Abstract: | With this algorithm all expressing formulae or- products of factors can result from the chart directly. Unfolding any expressing formula every product term is a tree. So all trees can result from the chart in separat batches directly Without repetition. |
| |
Keywords: | |
本文献已被 CNKI 等数据库收录! |
|