摘要
本文介绍了三种求二元关系的传递闭包的方法,其均有效地减少了传递闭包的运算量。
This paper introduces the three kinds of methods to obtain the transitive closure of binary relation on a finite set. These three kinds of algorithms all reduce operational quantity efficiently.
出处
《网络安全技术与应用》
2006年第4期48-49,84,共3页
Network Security Technology & Application
关键词
关系矩阵
二元关系
传递闭包
relation matrix
binary relation
transitive closure
