graph-theory

Definition

Strongly Connected Component

A strongly connected component of a directed graph is a maximal subgraph in which every vertex is reachable from every other vertex by respecting the direction of the edges.

Equivalently, it is an equivalence class under mutual reachability.