title: A two way minimum spanning tree of a directed graph
body: <p>Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist).</p>
  
  <p>Does such an algorithm exist?</p>