title: Finding strongly connected component in a directed Graph?
body: <p>I'm following Skiena's algorithm design manual. Implementation that I'm working on is for finding Strongly connected components. However There is one statement in the book which I do not understand that is "<strong>A new strongly connected component is found whenever the lowest reachable vertex from v is v".</strong> For example take a directed graph as shown below </p>
  
  <p><img src="https://i.stack.imgur.com/vYwct.jpg" alt="Directed Graph with Connected component"></p>
  
  <p>Here above statement is true for vertex "V3" and will give us strongly connected component but this statement is also true for V2 which do not give us any strongly connected component.</p>
  
  <p>My question is how does above statement always holds true ?</p>