title: probability of each terminal node in a directed graph
body: <p>I have a directed graph G(V,E) and weight w(u,v).</p>
  
  <p>In this graph weight w(u,v) represents how many times the node(v) has visited from node(u). for example(<a href="https://i.imgsafe.org/07196ec9d1.png" rel="noreferrer">See</a> this for a directed graph image):</p>
  
  <pre>
       1        3
    A ----- B ----- D
    | \____/|
   1|   4   |2
    |       |
    C       E
  </pre>
  
  <p>As C and B are visited once from A, D is visited 3 times from B and so on. Given this data how can I calculate exact probability to reach each terminal node i.e; C,E,D, if starting from A.</p>
  
  <p>Any suggestion?</p>