无向图G的极大连通子图称为G的连通分量( Connected Component)。任何连通图的连通分量只有一个，即是其自身，非连通的无向图有多个连通分量。
连通分量图G的一个连通分量(Connected Component)是G的一个最大连通子图，该子图中每对顶点间均有一条路径。根据图G，如何找出其所有连通分量的问题称为连通分量问题。
基于812个网页-相关网页
In the uncertainty reasoning layer, proposed a negative reading cleaning approach based on contain-relationship and adjacent-relationship, In the graph trim layer, proposed an active reading cleaning approach based on the connected component of graph.
在非确定性推理层,提出了一种基于包含关系和邻接关系的错读处理方法。 在图修剪层,提出了一种基于图连通分量的错读处理方法。
参考来源 - 非确定性RFID数据流清洗方法的研究·2,447,543篇论文数据，部分数据来源于NoteExpress
算法的关键是判断一个结点是否是强连通分量的根。
The crux of the algorithm comes in determining whether a node is the root of a strongly connected component.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
应用推荐