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 a 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 (that is, Θ(
![Strongly connected component - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/df03eb451330661c3d591185b839570b1291faf7/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2Fe%2Fe1%2FScc-1.svg%2F1200px-Scc-1.svg.png)