强连通组件（英语：Strongly connected component）是图论中的概念。图论中，强连通图指每一个顶点皆可以经由该图上的边抵达其他的每一个点的有向图。意即对于此图上每一个点对(V_a,V_b)，皆存在路径V_a→V_b以及V_b→V_a。强连通组件则是指一张有向图G的极大强连通子图G'。如果将每一个强连通组件缩成一个点，则原图G将会变成一张有向无环图。一张图被称为有向无环图若且唯若此图不具有点集合数量大于一的强连通分量，因为有向环即是一个强连通组件，而且任何的强连通组件皆具有至少一个有向环。

In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.