Identify Strongly Component Components (Algorithm)

$\text{SCC}(G)$:

1. Call Topological Sort (Algorithm) to generate list $L$.
2. While $L$ is not empty:
   1. Inspect first element $u$ in the list.
   2. Perform Depth First Search (Algorithm) on the Transpose Graph $G^T$ from $u$.
   3. Add all visited vertices to a new component $S$.
   4. Remove these vertices from the list $L$.
3. Return all components identified.