| 求强分图图的算法 |
| |
| 引用本文： | 朱螯鑫.求强分图图的算法[J].计算机工程与设计,1997,18(2):57-64. |
| |
| 作者姓名： | 朱螯鑫 |
| |
| 作者单位： | 北京数据处理技术研究所 |
| |
| 摘 要： | 由于如文献［１］［２］等的实际需要，对基于ＤＦＳ技术的求强分图算法进行扩充、改进，使之更完整。而算法的时间复杂性仍保持不变。
|
| 关 键 词： | 图论 算法 强连通分图 深度优先搜索 向量化 |
The Algorithm GSCA for Graph of Strongly-Connected Components |
| |
| Zhu,Aoxin.The Algorithm GSCA for Graph of Strongly-Connected Components[J].Computer Engineering and Design,1997,18(2):57-64. |
| |
| Authors: | Zhu Aoxin |
| |
| Affiliation: | Beijing Institute of Data Processing Technology |
| |
| Abstract: | Due to the actual needs like the references and , the Algorithm for strongly-connected component of graph based on DFS technology is expanded and improved in order to make it more complete. Furthermore, its complexity of time still keeps constant. |
| |
| Keywords: | Graph theory Algorithms Strong-connected component Depth-first search Vectorization |
| 本文献已被 CNKI 维普 等数据库收录！ |
