title: how can i list every path in a directed graph? (C#)
body: <p>please just point me in the right direction or tell me what to look up to solve this:</p>
  
  <p>I have a "tree" object that holds "node" objects. (actually it's called a directed graph).
  Each node holds the fields string "name" and "list" that contains the next nodes.</p>
  
  <p>How can I create lists of all possible node names from the head node to the foot node?
  each list is to hold a path from head to foot. the number of nodes from head to foot is always the same i.e: 6.</p>
  
  <p>this is what the tree looks like:</p>
  
  <p><img src="https://i631.photobucket.com/albums/uu32/see_sharp_guy/tree.png" alt="alt text"></p>
  
  <p>that diagram should give me:</p>
  
  <pre><code>list 1: n1,n2,n4,n5,n7,n9,n13.
  lsit 2: n1,n2,n4,n6,n8,n9,n13.
  list 3: n1,n2,n4,n10,n11,n12,n13
  </code></pre>
  
  <p>and so on.</p>
  
  <p>could some simply point me in the right direction? what kind of recursive algorithm should i use? should i use a recursive method or only loops? (i need to use this on the result of the dikstra algorithm.)</p>