Finding SCCs compresses a complex directed graph into a simpler DAG (directed acyclic graph). Each SCC becomes a single node in the condensation graph. This DAG has no cycles, so you can use topological sort and dynamic programming on it.
Real applications: Package managers use SCCs to detect circular dependencies. Build systems use them to find compilation order. Search engines use them to identify strongly connected web communities.