title: Algorithm to find the number of distinct paths in a directed graph
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/58306/graph-algorithm-to-find-all-connections-between-two-arbitrary-vertices">Graph Algorithm To Find All Connections Between Two Arbitrary Vertices</a>  </p>
  </blockquote>
  
  
  
  <p>I have a directed graph, what algorithm can i use to find the number of distinct acyclic paths between 2 particular vertices, and count the maximum times any path is used in these distinct paths? 
  Two paths are distinct if they either visit a different number of vertices or visit vertices in a different order.</p>