Explore relationships

Strongly connected component

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 strongly connected themselves.

Use + to expand a branch. Click a topic name to open its summary.