一类图形问题的求解

一类图形问题的求解 A Solution to a Kind of Graph Problem 曾颜 1 first-author 陈莘萌 1 周婕 1 武汉大学数学与计算机科学学院,武汉,430072 武汉大学数学与计算机科学学院,武汉,430072 College of Mathematics and Computer Science,Wuhan University College of Mathematics and Computer Science,Wuhan University 从有实际应用背景的问题出发，提出了一种求解一类图形中结点路径长度的方法．该方法利用层次结构的特点，将图的计算递归转换为图的构造速归，用非递归程序来求解．在构造图的同时完成计算，并在ＰｏｗｅｒＢｕｉｌｄｅｒ上予以实现．最后对算法作出了分析和评价． 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. 层次结构 实例 继承性 hierarchical system instance inheritance 10.14188/j.1671-8836.2000.01.008 F224 2000-01-01 2021-04-01 1