title: Drawing massive networkx graph: Array too big
body: <p>I'm trying to draw a networkx graph with weighted edges, but right now I'm having some difficulty.</p>
  
  <p>As the title suggests, this graph is really huge:</p>
  
  <p>Number of Nodes:  103362
  Number of Edges:  1419671    </p>
  
  <p>And when I try to draw this graph with the following code:</p>
  
  <pre><code>pos = nx.spring_layout(G)
  nx.draw(G, node_color='#A0CBE2',edge_color='#BB0000',width=2,edge_cmap=plt.cm.Blues,with_labels=False)
  plt.savefig("edge_colormap.png") # save as png
  plt.show() # display
  </code></pre>
  
  <p>(This is just me testing functionality, not my desired end result). I get the error:</p>
  
  <p>ValueError: array is too big.</p>
  
  <p>It's triggered from the spring_layout algorithm. Any idea what's causing this? Even when I use a different pos algorithm I get the same error, how can I avoid it (if I can)?</p>
  
  <p>On another note, I want to colour the edges based on their weight. As you can see there are a lot of edges and probably a wide range of weights, what is the best way to do this?</p>
  
  <p>Thanks for your patience.</p>
  
  <p>EDIT FROM MY COMMENT:</p>
  
  <p>I'm trying to investigate the density of the data I have. Basically I am looking at 50,000 matches each containing 10 players, and whenever two players meet in a game I +1 to the weight of the edge between them. The idea is that my end result will show me the strength of my data set. In my mind I want the heaviest edges at the centre and as we move out from the centre the data is less densely connected.</p>