title: finding all simple paths between two points of a graph with cycles
body: <p>I am trying to compute all simple paths between two nodes.
  I tried DFS and it seems DFS will not work.</p>
  
  <p>The following figure make my goal more clear.</p>
  
  <p><a href="https://i.stack.imgur.com/Zu4Ji.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Zu4Ji.png" alt="enter image description here"></a></p>
  
  <p>two nodes 'a' and 'f' is given, and have to find paths between them.
  for above example, there are two simple paths:</p>
  
  <p>a ->b ->c ->e ->f</p>
  
  <p>a ->b ->d ->e ->f</p>
  
  <p>I checked some posts, but they seems don't handle cycles( without cycles my DFS works).</p>
  
  <p>The graph is undirected and has cycles. I believe there is a solution for this.
  could anyone point me a reliable algorithm ? 
  it would be great if such algorithm comes with pseudocode.</p>
  
  <p>Thanks in advance
  Best,</p>