摘要
可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法,该方法计算简便.
Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph,it provides the calculating method of reachable matrix with the property of the Boolean matrix operation,the calculation method is easy and simple.
出处
《大庆石油学院学报》
CAS
北大核心
2006年第6期99-100,129,共2页
Journal of Daqing Petroleum Institute
关键词
有向图
邻接矩阵
布尔矩阵
可达矩阵
directed graph
adjacency matrix
Boolean matrix
reachability matrix
