Strongly connected component

Strongly connected component --- бикомпонента, сильная компонента, компонента сильной связности.

The relation of strong connection (see Strongly connected vertices) is an equivalence relation on the vertex set of a digraph. Strong connection partitions the vertices of this graph into subsets, each of which

induces a strongly connected component (or bicomponent).

In other words, the strongly connected components of a directed graph [math]\displaystyle{ G }[/math] are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph called the condensation (or factor-graph) of [math]\displaystyle{ G }[/math].