title: Traversal directed graph with cycles
body: <p>I wrote a script to construct a directed graph using networkx in python, and I want to get all possible path from start to end including cycles.
  For example, there is a directed graph:
  <a href="https://i.stack.imgur.com/ZuGHX.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/ZuGHX.png" alt="enter image description here"></a></p>
  
  <p>I want to get these paths:</p>
  
  <p>A->B->D</p>
  
  <p>A->B->C->D</p>
  
  <p>A->B->C->B->D</p>
  
  <p>A->B->C->B->C->B->D</p>
  
  <p>...</p>
  
  <p>As far as I know, there are many algorithms to find shortest paths or paths without cycles between 2 nodes, but I want to find paths with cycles.</p>
  
  <p>Is there any algorithm to achieve this ?</p>
  
  <p>Thx a lot</p>