title: Path between two nodes
body: <p>I'm using networkx to work with graphs. I have pretty large graph (it's near 200 nodes in it) and I try to find all possible paths between two nodes. But, as I understand, networkx can find only shortest path. How can I get not just shortest path, but all possible paths?</p>
  
  <p>UPD: path can contain each node only once.</p>
  
  <p>UPD2: I need something like find_all_paths() function, described here: python.org/doc/essays/graphs.html  But this function doesn't work well with large number of nodes and edged =( </p>