title: Does Tarjan's SCC algorithm give a topological sort of the SCC?
body: <p>I've been studying SCC and algorithms about them, and I've seen that people almost always mention that Kosaraju's algorithm finds the SCC and also gives them ordered in a (reversed) topological sort.</p>
  
  <p>My question is: doesn't Tarjan's algorithm also find a (reversed) topological sort? I've found that it isn't mentioned (at least from where I've read, except wikipedia).</p>
  
  <p>I've been thinking about it and make perfect sense. When tarjans_dfs is called on some node u, all SCCs that are reachable from u will be found before u's SCC. Am I wrong?</p>
  
  <p>Wikipedia says it actually does find it:</p>
  
  <blockquote>
    <p>"While there is nothing special about the order of the nodes within
    each strongly connected component, one useful property of the
    algorithm is that no strongly connected component will be identified
    before any of its successors. Therefore, the order in which the
    strongly connected components are identified constitutes a reverse
    topological sort of the DAG formed by the strongly connected
    components."</p>
  </blockquote>
  
  <p>Is it my idea, or is it much more known that Kosaraju's algorithm finds the topological order than the fact that Tarjan's also does it?</p>