Strongly Connected Components

Defn: G is strongly connected if for all u,v there is a (directed) path from u to v and from v to u.[Equivalently: there is a cycle through u and v.]

Defn: a strongly connected component of G is a maximal strongly connected subgraph.

Defn: G is strongly connected if for all u,v there is a (directed) path from u to v and from v to u. [Equivalently: there is a cycle through u and v.]