title: Algorithm to check if directed graph is strongly connected
body: <p>I need to check if a directed graph is <em>strongly connected</em>, or, in other words, if all nodes can be reached by any other node (not necessarily through direct edge).</p>
  
  <p>One way of doing this is running a DFS and BFS on every node and see all others are still reachable. </p>
  
  <p>Is there a better approach to do that?</p>