摘要
分析了几种求解二元关系传递闭包方法的特点,并利用二元关系传递闭包与有向图的可达性矩阵之间的关系,实现了采用Warshall算法对可达性矩阵的求取,简化了计算可达性矩阵的算法.
The characteristics of solutions about the transitive closure for binary relation are analyzed. By using the relation between it and reachability matrix of graph, Warshall algorithm is adopted to computing the teachability matrix, which simplifies the computing process.
出处
《黔南民族师范学院学报》
2008年第6期45-47,86,共4页
Journal of Qiannan Normal University for Nationalities
