Hi guys, I'm trying to develop a Bayesian Network just "for fun" XD
My first problem is to understand how represent the graph necessary a DAG. I come out with something : https://gist.github.com/3111539 (Very very first stage I just finish to write this code) But I have some question to how represent properly the DAG. I need to map every child of every node, or I just need to know the (non-)descendants of every node ? Why ? Do you have any useful link that I can use ? Thank you guys anyway. PS: This is still me http://stackoverflow.com/questions/11482474/clojure-dag-bayesian-network#comment15165499_11482474 -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
