摘要
介绍了采用邻接矩阵作关系矩阵解有向图的可达矩阵的一种简捷算法———轮流做媒法．
A simple and direct algorithm for computing reachability matrix of directed graph is introduced and proved.
出处
《西安工业学院学报》
1997年第2期165-167,共3页
Journal of Xi'an Institute of Technology
关键词
有向图
可达矩阵
强分图
轮流做媒法
directed graph reachability matrix algorithm strong component of directed graph
