| 一类图形问题的求解 |
| |
| 引用本文： | 曾颜,陈莘萌,周婕. 一类图形问题的求解[J]. 武汉大学学报(理学版), 2000, 46(1): 29-32 |
| |
| 作者姓名： | 曾颜 陈莘萌 周婕 |
| |
| 作者单位： | 武汉大学数学与计算机科学学院,武汉,430072 |
| |
| 摘 要： | 从有实际应用背景的问题出发,提出了一种求解一类图形中结点路径长度的方法．该方法利用层次结构的特点,将图的计算递归转换为图的构造递归．用非递归程序来求解．在构造图的同时完成计算,并在PowerBuilder上予以实现．最后对算法作出了分析和评价．
|
| 关 键 词： | 层次结构 实例 继承性 |
| 文章编号： | 0253-9888(2000)01-0029-04 |
| 修稿时间： | 1999-05-03 |
A Solution to a Kind of Graph Problem |
| |
| ZENG Yan,CHEN Xin-meng,ZHOU Jie. A Solution to a Kind of Graph Problem[J]. JOurnal of Wuhan University:Natural Science Edition, 2000, 46(1): 29-32 |
| |
| Authors: | ZENG Yan CHEN Xin-meng ZHOU Jie |
| |
| Affiliation: | ZENG Yan ,CHEN Xin-meng ,ZHOU Jie ;(College of Mathematics and Computer Science,Wuhan University, Wuhan 430072,China) |
| |
| Abstract: | To meet the needs of applications, a solution to the distance between the nodes in a kind of graph is proposed. The construction recursion of the graph is focused on instead of the computation recursion, which is computed at the same time as the construction. It is implemented in PowerBuilder without recursive functions. In the end, the efficiency and the limitation of the algorithm are discussed. |
| |
| Keywords: | hierarchical system instance inheritance |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
