Based on the algorithm to find strongly connected nodes of a graph, this paper presents a linear time algorithm to detect modules of a fault tree.
基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
应用推荐