title: Simple Paths between 2 nodes
body: <p>I know that myself,and many others probably stuch here,</p>
  
  <p>Well,according to the <strong>CLRS(3 edition,22.4.2)</strong>,there is a O(n) algorithm for finding all simple paths between 2 nodes in a directed acyclic graph.
  I went through similar questions,<a href="https://stackoverflow.com/questions/5164719/number-of-paths-between-two-nodes-in-a-dag?lq=1">Number of paths between two nodes in a DAG</a> and <a href="https://stackoverflow.com/questions/9802755/all-the-paths-between-2-nodes-in-graph">All the paths between 2 nodes in graph</a>,but on both occasions,no proper explanation or pseudocode is mentioned,or if it is,i doubt that is it the most efficient one (<code>O(n)</code>).</p>
  
  <p>If someone could really post one exact code,or pseudocode,which settles the deal,because as i went through all those above links,i didnt really find 1 single answer which stands Tall.</p>
  
  <p>It would be better if the code also handles <strong>cyclic</strong> graphs,i.e,<strong>IF there is a cycle</strong> in the graph,but <strong>If no path</strong> between two nodes contains the <strong>cycle</strong>,the number of paths SHOULD be <strong>FINITE,else INFINITE.</strong></p>