[cl-graph-devel] Bayesian networks

[Joel Reymont]

Folks,

I'm considering using cl-graph to implement Bayesian networks. These  
are DAGs with weights assigned to each edge and values in the  
vertices that don't have edges coming into them (root vertices in cl- 
graph?).

Is it possible to sum up all the paths through a cl-graph such as  
that the value of each non-root vertex is the weight of the edge  
coming into it multiplied by the value of the vertex that the edge  
connects to?

	Thanks, Joel

--
http://wagerlabs.com/