I have a directed graph G(V,E) and weight w(u,v).
In this graph weight w(u,v) represents how many times the node(v) has visited from node(u). for example(See this for a directed graph image):
1 3 A ----- B ----- D | \____/| 1| 4 |2 | | C E
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.
Any suggestion?