title: Strongly Connected Components : Kosaraju algorithm
body: <p>In Kosaraju algorithm I came across two possible implementations:</p>
  
  <p>1) Search for strongly connected components in the reversed graph in the topological order of vertices in the original graph.</p>
  
  <p>2) Search for strongly connected components in the original graph in the topological order of vertices in the reversed graph.</p>
  
  <p>I wanted to that is it wrong to search for strongly connected components in the original graph using vertices in its reversed topological order. This will be better in terms of memory also as there is no need for a new adjacency list.</p>
  
  <p>sources :1) <a href="https://cp-algorithms.com/graph/strongly-connected-components.html" rel="nofollow noreferrer">E-Maxx</a> , 2) CLRS book</p>