title: Algorithm for finding distinct paths from A to B in weighted, directed, cyclic graph
body: <p>Suppose we have a <strong>DIRECTED</strong>, <strong>WEIGHTED</strong> and <strong>CYCLIC</strong> graph.</p>
  
  <p>Suppose we are only interested in paths with a <strong>total weight of less than MAX_WEIGHT</strong></p>
  
  <p>What is the most appropriate (or any) algorithm to find the <strong>number of distinct paths</strong> between two nodes A and B that have a total weight of less than MAX_WEIGHT?</p>
  
  <p>P.S: It's not my homework. Just personal, non-commercial project.</p>