title: Using Strongly Connected Component Algo to check if a vertex is reachable
body: <p>I would like to see if a given vertex, say V0,  can be reachable by all other vertices in a graph G.<br>
  I know I can just traverse through each vertex in the graph and do BFS/DFS to see if V0 is reachable.<br>
  However, this seems to be very inefficient.  </p>
  
  <p>I was wondering if i do SCC algo on the graph and if v0 is part of all scc, then I can safely conclude that v0 is reachable by all vertices?  This would be great because the cost of SCC is only O(V+E) with Tarjan's and checking to see if v0 is part of scc would also cost linear time. </p>
  
  <p>I would think this makes sense because SCC means vertices are reachable. Any confirmation to this logic? </p>
  
  <p>or any efficient approach to this?</p>