strongly connected component

(graph theory) Given a directed graph, a maximal strongly connected subgraph.

Japanese Meaning

有向グラフにおいて、極大の強連結部分グラフ

To identify the strongly connected component containing node v, run Kosaraju's algorithm on the directed graph.

ノードvを含む最大強連結部分グラフを特定するには、有向グラフに対してコサラジュのアルゴリズムを実行してください。

Sense（1）

(graph theory) Given a directed graph, a maximal strongly connected subgraph.

strongly connected components

（ plural ）