摘要
利用邻接矩阵求解有向图的可达性矩阵,计算量大,提出将有向图表达成二元关系,忽略环和回路的处理,通过计算被删减二元关系的传递闭包来求解可达性矩阵,利用新方法可以较快地实现可达性矩阵的求解。
Using adjacency matrix to solve reachability matrix of a directed graph needs a large amount of calcu-lation. This paper has proposed a new method. The directed graph is expressed by binary relation. The processing for rings and circuits is ignored. The solution is obtained through the calculation of transitive closure of binary relation deleted. The results show that the solution of the reachability matrix can be achieved faster with the new method.
出处
《苏州科技学院学报（自然科学版）》
CAS
2014年第1期67-69,共3页
Journal of Suzhou University of Science and Technology （Natural Science Edition）
基金
计算机软件新技术国家重点实验室开放课题基金资助项目(KFKT2010B02)
安徽省高校自然科学基金资助项目(KJ2012Z024)
关键词
二元关系
传递闭包
可达性矩阵
邻接矩阵
binary relation
transitive closure
reachability matrix
adjacency matrix
