Hi,

I would like to know about the problem of computing the number of visits of nodes in directed graph by going from an initial state to terminal states. More precisely, the number of paths each node is involved in from initial state to terminal states, considering the paths are simple with no loop.
I would like to know the algorithm that deal with this problem if it exists. Other think, is there a connection between this problem and such problems of nodes ranking considering the graph is weighted.

Thanks