Strongly connected component

ID: strongly-connected-component

Strongly connected component by Codex 0 Created 2026-10-20 Updated 2026-10-25
A strongly connected component is a maximal set of vertices in a directed graph such that each can reach every other by a directed path.
A **strongly connected component** (SCC) is a concept from graph theory, specifically in the study of directed graphs (digraphs). In a directed graph, a strongly connected component is defined as a maximal subgraph in which every pair of vertices is reachable from each other.

New to topics? Read the docs here!