计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (28): 60-61.DOI: 10.3778/j.issn.1002-8331.2008.28.021
• 理论研究 • 上一篇 下一篇
张世龙,沈玉利
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
ZHANG Shi-long,SHEN Yu-li
Received:
Revised:
Online:
Published:
Contact:
摘要： 围绕二元关系的传递闭包分析比较了著名的Warshall算法，给出了一个加列算法。当关系矩阵是稀疏矩阵时，该算法效率比Warshall算法高。
关键词: 二元关系, 传递闭包, Warshall算法, 加列算法
Abstract: This paper analyses and compares the famous Warshall algorithm，and presents a column-added algorithm，which is faster than Warshall algorithm when the relation matrix of binary relation is sparse.
Key words: binary relation, transitive closure, warshall algorithm, Column-Added algorithm
张世龙,沈玉利. 稀疏矩阵情况下Warshall算法的改进[J]. 计算机工程与应用, 2008, 44(28): 60-61.
ZHANG Shi-long,SHEN Yu-li. Improvement of Warshall algorithm based on sparse matrix[J]. Computer Engineering and Applications, 2008, 44(28): 60-61.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2008.28.021
http://cea.ceaj.org/CN/Y2008/V44/I28/60
