title: Weakly connected Graph?
body: <p>From <a href="http://en.wikipedia.org/wiki/Connectivity_%28graph_theory%29" rel="nofollow noreferrer">the Wikipedia page</a>:</p>
  
  <blockquote>
    <p>"A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph"</p>
  </blockquote>
  
  <p>Is this accurate? </p>
  
  <p><img src="https://i.stack.imgur.com/Ga7YF.jpg" alt="enter image description here"></p>
  
  <p>The above graph is connected when all directed edges are replaced with undirected edges.But there is no path between B to D or D to B which violates the weakly typed property..Am i right?</p>