| 有向图的所有强连通分量 |
| |
| 引用本文： | 夏启寿.有向图的所有强连通分量[J].黄山学院学报,2004,6(6):22-23. |
| |
| 作者姓名： | 夏启寿 |
| |
| 作者单位： | 池州师范专科学校,计算机中心,安徽,池州,247000 |
| |
| 摘 要： | 现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。本文利用邻接矩阵存放有向图，用非递归的方法来求有向图的所有强边通分量。
|
| 关 键 词： | 有向图 强连通分量 |
| 文章编号： | 1672-447X(2004)06-0022-02 |
| 修稿时间： | 2004年11月2日 |
On All The Strong Connected Components of The Directed Graph |
| |
| Xia QiShou.On All The Strong Connected Components of The Directed Graph[J].Journal of Huangshan University,2004,6(6):22-23. |
| |
| Authors: | Xia QiShou |
| |
| Abstract: | Many documents and papers nowadays have discussed the strong connected component of the directed graph,and the method they adopted is usually Recursion.This paper,with the graph in an abuttal matrix,seeks all the strong connected components of it with a non-recursion method. |
| |
| Keywords: | the directed graph strong connected component |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
