title: Find cliques of length k in a graph
body: <p>I'm working with graphs of ~200 nodes and ~3500 edges. I need to find all cliques of this graph. Using networkx's <code>enumerate_all_cliques()</code> works fine with smaller graphs of up to 100 nodes, but runs out of memory for bigger ones.</p>
  
  <blockquote>
    <p>"This algorithm however, hopefully, does not run out of memory
        since it only keeps candidate sublists in memory and
        continuously removes exhausted sublists."<a href="http://networkx.github.io/documentation/development/_modules/networkx/algorithms/clique.html" rel="nofollow">source code for enumerate_all_cliques()</a></p>
  </blockquote>
  
  <p>Is there maybe a way to return a generator of all cliques of length k, instead of all cliques, in order to save memory?</p>