摘要
现在有一些文献对有向图的强连通分量做了一些讨论,一般采用了递归的方法。本文利用邻接 矩阵存放有向图,用非递归的方法来求有向图的所有强迫通分量。
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.
出处
《黄山学院学报》
2004年第6期22-23,共2页
Journal of Huangshan University