# Find strongly connected components for a directed graph
Last edited: 2026-01-28
# Statement
in a directed graph Given a directed graph $G = (V,E)$ how can we find a mapping from its vertices $V$ to the strongly connected components of $G$.
# Solutions
- DFS for finding strongly connected components
- This runs in $O(\vert V \vert \cdot \vert E \vert)$ time.
- It also outputs the strongly connected components in reverse topological sort .