Is there a Perl implementation of Factor Graphs sum-product scheduling?

Are there good example codes of implementations of factor graph sum-product scheduling? I am new to the concept, and wou开发者_如何学JAVAld like to see how it gets implemented.

According to these lecture notes, a factor graph is a bipartite graph. I do not think there is an implementation of the Sum-product scheduling algorithm on CPAN, but one of these modules can provide a starting point.

Specifically, Graph::Maker::Bipartite can facilitate the construction of the graph and you can then use Graph to traverse through nodes and iterate if you have a complete specification of the algorithm (which this other set of lecture notes seems to provide.