| 基于带回溯传播信息和编码技术的求解传递闭包方法 |
| |
| 引用本文： | 邬长安.基于带回溯传播信息和编码技术的求解传递闭包方法[J].信阳师范学院学报(自然科学版),2000,13(1):66-70. |
| |
| 作者姓名： | 邬长安 |
| |
| 作者单位： | 信阳师范学院计算机系,河南,信阳,464000 |
| |
| 基金项目： | 河南省科技攻关资助项目(991140146,95000317) |
| |
| 摘 要： | 求解传递闭包问题是计算机科学中的一经典问题.文章提出了一种新的传递闭包算法,并导出了若干理论结果,能够将任一关系图化为左偏序图,它是基于带回溯传播信息和编码技术的深度优先搜索算法,该算法效率高,且易于实现.
|
| 关 键 词： | 关系图 传递闭包 信息传播图 编码 算法 |
| 文章编号： | 1003-0972(2000)01-0066-05 |
A method of solving transitive closure based on backtracking spread information and coding technique |
| |
| WU Chang,an.A method of solving transitive closure based on backtracking spread information and coding technique[J].Journal of Xinyang Teachers College(Natural Science Edition),2000,13(1):66-70. |
| |
| Authors: | WU Chang an |
| |
| Abstract: | Solving transitive closure is a classical problem in computer science.In this paper,the author proposes a new transtive closure algorithm,and deduces out some theoretical results.The results can change any relation graph into left deflective order graph.The algorithm is a depth first searching algorithm based on backtracking spread information and coding technique.It is effective,and its realizing is easy. |
| |
| Keywords: | relation graph transitive closure spread information graph coding leftdeflective order graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
