title: Finding all paths/walks of given length in a networkx graph
body: <p>I'm using networkx and trying to find all the walks with length 3 in the graph, specifically the paths with three edges. I tried to find some information about the algorithms in the networkx documentation but I could only find the algorithms for the shortest path in the graph. Can I find a length of a path trough specific nodes, for example a path trough nodes 14 -> 11 -> 12 -> 16 if the shortest path is 14 -> 15 -> 16? Here's an image of a graph for an example:</p>
  
  <p><a href="https://i.stack.imgur.com/pt7ib.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/pt7ib.jpg" alt="example graph"></a></p>