![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/e/e1/Scc-1.svg/640px-Scc-1.svg.png&w=640&q=50)
Strongly connected component
Partition of a graph whose components are reachable from all vertices / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Strongly connected component?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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, Θ(V + E )).
![](http://upload.wikimedia.org/wikipedia/commons/thumb/e/e1/Scc-1.svg/640px-Scc-1.svg.png)