摘要
求解传递闭包问题是计算机科学中的一经典问题．文章提出了一种新的传递闭包算法，并导出了若干理论结果，能够将任一关系图化为左偏序图，它是基于带回溯传播信息和编码技术的深度优先搜索算法，该算法效率高，且易于实现．
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.
出处
《信阳师范学院学报（自然科学版）》
CAS
2000年第1期66-70,共5页
Journal of Xinyang Normal University(Natural Science Edition)
基金
河南省科技攻关资助!(991140146
95000317)
关键词
关系图
传递闭包
信息传播图
编码
算法
relation graph
transitive closure
spread information graph
coding
leftdeflective order graph
