What is a Strongly Connected Component (SCC)?

What is a Strongly Connected Component (SCC)?

Approach: Define a subgraph where every vertex is reachable from every other vertex.

A maximal subgraph of a directed graph where there is a path from every vertex in the subgraph to every other vertex in the subgraph.

Follow-up: Name an algorithm to find SCCs. (Tarjan or Kosaraju)

Key concepts: directed graph, reachability, condensation graph.