Topological sort and SCC detection solve different problems. Topological sort works only on DAGs (directed acyclic graphs). If your graph has cycles, you cannot topologically sort it.
But you can find SCCs first, compress the graph into the condensation DAG, then topologically sort the condensation graph. This gives you a valid ordering of the components. Use topological sort directly on DAGs. Use SCC + topological sort on cyclic directed graphs to get component ordering.