摘要
给出一种通过有向图可达矩阵求取强分图和单向分图的方法,此方法回避了结点的次序问题.
Avoiding considering the sequence of nodes, this paper proposes a new approach to work out both strongly connected and unilaterally connected components of a directed graph by using accesible matrix.
出处
《西南民族大学学报（自然科学版）》
CAS
2007年第6期1224-1228,共5页
Journal of Southwest Minzu University(Natural Science Edition)
基金
四川省教育厅科研基金项目(2006C057).
关键词
有向图
可达矩阵
强分图
单向分图
directed graph
accessible matrix
strongly connected component
unilaterally connected component
