title: Floyd-Warshall to Graph networkx
body: <p>I created a graph using networkx (Python). I am trying to convert it to DiGraph but I can't get it right. I need to create (and work on) a Graph first, so I can't start using DiGraph() to build it at the beginning. I would assign "1" to all weights. </p>
  
  <p>The things I am trying to do are:</p>
  
  <ul>
  <li><p>convert my Graph G to a DiGraph D</p></li>
  <li><p>use <em>networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance</em> in order to obtain all shortest paths</p></li>
  <li><p>use <em>networkx.algorithms.shortest_paths.dense.reconstruct_path</em> in order to get the path from a start node to an end node and print it.</p></li>
  </ul>
  
  <p>The thing is, I am stuck at the beginning. FW implementation doesn't work on Graph, so I can't do it until I convert G to D.</p>
  
  <p>Can anybody help me please?</p>