| 拓扑图的一种双向搜寻法 |
| |
| 引用本文： | 徐静波,周美华.拓扑图的一种双向搜寻法[J].东华大学学报(自然科学版),1990(1). |
| |
| 作者姓名： | 徐静波 周美华 |
| |
| 作者单位： | 上海工程技术大学，中国纺织大学 |
| |
| 摘 要： | 关于图G的节点(数码对)所作的双向搜寻产生一种搜寻树.由叠套结构组合出码,构成算法,基于节点关联矩阵的数码比较运算,逐层产生搜索树.用搜索树可系统地产生任意图的全部Hamilton回路,也可产生两节点间全部路径的完整系统.本算法易于编制程序,其速度快,内存小的优点是显而易见的.
|
| 关 键 词： | 图论 Hamilton回路 路径 算法 |
A BI-DIRECTION SEARCHING METHOD FOR GRAPH G |
| |
| Xu Jingbo Shanghai University of Engineering Science,Zhou Meihua China Textile University.A BI-DIRECTION SEARCHING METHOD FOR GRAPH G[J].Journal of Donghua University,1990(1). |
| |
| Authors: | Xu Jingbo Shanghai University of Engineering Science Zhou Meihua China Textile University |
| |
| Institution: | Xu Jingbo Shanghai University of Engineering Science
Zhou Meihua China Textile University |
| |
| Abstract: | The searching-tree is obtained by the bi-direction searching for the coupled nodecode of the graph. The couples of code are in a stratified construction of the searching-tree. The algorithm is based on the comparison operation of the codes in the node incidence matrix. From the searching-tree obtained stratum by stratum both the entire Hamilton circle system and the whole system of paths between two nodes can be produced. Programs can be worked out easily by means of this algorithm with the obvious advantages in the computer speed and memory required. |
| |
| Keywords: | graph theory Hamilton circle path algorithm |
| 本文献已被 CNKI 等数据库收录！ |
