| 求强连通分量的几种算法的实现与分析 |
| |
| 引用本文： | 陈燕,江克勤. 求强连通分量的几种算法的实现与分析[J]. 数字社区&智能家居, 2011, 0(9) |
| |
| 作者姓名： | 陈燕 江克勤 |
| |
| 作者单位： | 南京市卫生监督所;安庆师范学院计算机与信息学院; |
| |
| 基金项目： | 安徽省高等学校省级重点教学研究项目(2008jyxm124) |
| |
| 摘 要： | 有向图的强连通性是图论中的经典问题,有着很多重要的应用。该文给出了求强连通分量的Kosaraju、Tarjan和Gabow三个算法的具体实现,并对算法的效率进行了分析。
|
| 关 键 词： | 强连通分量 深度优先搜索 Kosaraju算法 Tarjan算法 Gabow算法 |
The Implementation and Analysis of Several Algorithms About Strongly Connected Components |
| |
| CHEN Yan,JIANG Ke-qin. The Implementation and Analysis of Several Algorithms About Strongly Connected Components[J]. Digital Community & Smart Home, 2011, 0(9) |
| |
| Authors: | CHEN Yan JIANG Ke-qin |
| |
| Affiliation: | CHEN Yan1,JIANG Ke-qin2 (1.Nanjing Health Inspection Bureau,Nanjing 210003,China,2.School of Computer and Information,Anqing Teachers College,Anqing 246011,China) |
| |
| Abstract: | Digraph of strong connectivity is the classic problems in graph theory,which arises in many important applications.In this paper,the detailed implementation of Kosaraju,Tarjan and Gabow algorithms is discussed for solving strongly connected components,and the efficiency of three algorithms is analyzed. |
| |
| Keywords: | strongly connected components depth first search Kosaraju Tarjan Gabow |
| 本文献已被 CNKI 等数据库收录！ |
|
