title: How to create an adjacency matrix of a directed graph?
body: <p>I am trying to make an adjacency matrix of a directed graph in python.<br>
  I understand the concept of adjacency matrix, but I am not able to create an adjacency matrix in python.<br>
  I have represented the directed graph using inlinks and outlinks where "inlinks" are incoming edges to a node and "outlinks" are outgoing edges from a node:  </p>
  
  <pre><code>data = {'19.json': {'outlink': [], 'inlink': []}, 
          '26.json': {'outlink': [], 'inlink': []}, 
          '4.json': {'outlink': [], 'inlink': []}, 
          '25.json': {'outlink': [], 'inlink': []}, 
          '1.json': {'outlink': [], 'inlink': ['17.json', '2.json']}, 
          '24.json': {'outlink': [], 'inlink': []}, 
          '13.json': {'outlink': [], 'inlink': []}, 
          '16.json': {'outlink': [], 'inlink': []}, 
          '14.json': {'outlink': ['17.json', '2.json'], 'inlink': []}, 
          '17.json': {'outlink': ['1.json', '23.json'], 'inlink': ['14.json']}, 
          '15.json': {'outlink': [], 'inlink': []}, 
          '3.json': {'outlink': [], 'inlink': []}, 
          '9.json': {'outlink': [], 'inlink': []}}
  </code></pre>
  
  <p>How can I create its adjacency matrix using the representation above in python? </p>
  
  <p>I am really stuck here.</p>