In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex, and its strongly connected components form a partition into subgraphs that are themselves strongly connected.
A graph is said to be strongly connected if every vertex is reachable from every other vertex. This was in the mathematical theory of directed graphs. Its strongly connected components form a partition into subgraphs. This is in the mathematical theory of directed graphs. These subgraphs are themselves strongly connected.