title: Find all paths on undirected Graph
body: <p>I have an undirected graph and i want to list all possible paths from a starting node.
  Each connection between 2 nodes is unique in a listed  path is unique, for example give this graph representation:</p>
  
  <pre><code>{A: [B, C, D],
   B: [A, C, D],
   C: [A, B, D],
   D: [A, B, C]}
  </code></pre>
  
  <p>some listed path starting from <code>A</code></p>
  
  <pre><code>A, B, C, D, A, C  in this path we have a connection between
  A and B but we can't have a connection between B and A 
  </code></pre>
  
  <p>I can't accomplish it using the existing algorithm that i know like DFS .
  Any help will be very appreciated .</p>