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.

基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。

youdao

The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.

算法的输入是一个有向图，产生一个图的强连通分量顶点划分。

youdao

So a researching algorithm of connected area is given, a function of routing change position is defined for the distinguish of table and graph.

为此，给出了连通区域搜索算法，定义了用于区分表格与图形的行程位置转化函数。

youdao