摘要： 围绕传递闭包分析比较了著名的Warshall算法,给出了一个三角形算法。当关系矩阵是稀疏矩阵时,该算法比Warshall快。
关键词:
二元关系,
传递闭包,
Warshall算法
Abstract: This paper analyses and compares the famous Warshall algorithm,and presents a triangular algorithm,which is faster than Warshall algorithm when the relation matrix is sparse.
中图分类号:
刘任任,陈建二,陈松乔. 基于求传递闭包的Warshall算法的改进[J]. , 2005, 31(19): 48-.
LIU Renren1,2,CHEN Jianer2,CHEN Songqiao2. Improvement of Warshall Algorithm Based on Transitive Closure[J]. , 2005, 31(19): 48-.