[jgrapht-users] Question Rearding graph Theory algorithm

[Hicheminfo <lm...@gm...>]

Hi,
I would like to know the algorithm that computes the number of occurrences
of a node in directed graph starting from an initial state to terminal
state. More precisely, the number of paths such node n is included in from
initial state to terminal state considering the paths are simple. 



--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Question-Rearding-graph-Theory-algorithm-tp4024726.html
Sent from the jgrapht-users mailing list archive at Nabble.com.