title: Finding components of very large graph
body: <p>I have a very large graph represented in a text file of size about 1TB with each edge as follows.</p>
  
  <pre><code>From-node to-node
  </code></pre>
  
  <p>I would like to split it into its weakly connected components.  If it was smaller I could load it into networkx and run their component finding algorithms.  For example 
  <a href="http://networkx.github.io/documentation/latest/reference/generated/networkx.algorithms.components.connected.connected_components.html#networkx.algorithms.components.connected.connected_components" rel="noreferrer">http://networkx.github.io/documentation/latest/reference/generated/networkx.algorithms.components.connected.connected_components.html#networkx.algorithms.components.connected.connected_components</a></p>
  
  <p>Is there any way to do this without loading the whole thing into memory?</p>