{"action":"created","issue":{"url":"https://api.github.com/repos/mjs2600/mimicry/issues/10","labels_url":"https://api.github.com/repos/mjs2600/mimicry/issues/10/labels{/name}","comments_url":"https://api.github.com/repos/mjs2600/mimicry/issues/10/comments","events_url":"https://api.github.com/repos/mjs2600/mimicry/issues/10/events","html_url":"https://github.com/mjs2600/mimicry/issues/10","id":58837140,"number":10,"title":"Construct the bayes net from the maximum spanning tree","user":{"login":"mjs2600","id":434305,"avatar_url":"https://avatars.githubusercontent.com/u/434305?v=3","gravatar_id":"","url":"https://api.github.com/users/mjs2600","html_url":"https://github.com/mjs2600","followers_url":"https://api.github.com/users/mjs2600/followers","following_url":"https://api.github.com/users/mjs2600/following{/other_user}","gists_url":"https://api.github.com/users/mjs2600/gists{/gist_id}","starred_url":"https://api.github.com/users/mjs2600/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/mjs2600/subscriptions","organizations_url":"https://api.github.com/users/mjs2600/orgs","repos_url":"https://api.github.com/users/mjs2600/repos","events_url":"https://api.github.com/users/mjs2600/events{/privacy}","received_events_url":"https://api.github.com/users/mjs2600/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-02-25T01:44:59Z","updated_at":"2015-02-26T05:24:53Z","closed_at":null,"body":""},"comment":{"url":"https://api.github.com/repos/mjs2600/mimicry/issues/comments/76124431","html_url":"https://github.com/mjs2600/mimicry/issues/10#issuecomment-76124431","issue_url":"https://api.github.com/repos/mjs2600/mimicry/issues/10","id":76124431,"user":{"login":"jlmcgehee21","id":8727616,"avatar_url":"https://avatars.githubusercontent.com/u/8727616?v=3","gravatar_id":"","url":"https://api.github.com/users/jlmcgehee21","html_url":"https://github.com/jlmcgehee21","followers_url":"https://api.github.com/users/jlmcgehee21/followers","following_url":"https://api.github.com/users/jlmcgehee21/following{/other_user}","gists_url":"https://api.github.com/users/jlmcgehee21/gists{/gist_id}","starred_url":"https://api.github.com/users/jlmcgehee21/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jlmcgehee21/subscriptions","organizations_url":"https://api.github.com/users/jlmcgehee21/orgs","repos_url":"https://api.github.com/users/jlmcgehee21/repos","events_url":"https://api.github.com/users/jlmcgehee21/events{/privacy}","received_events_url":"https://api.github.com/users/jlmcgehee21/received_events","type":"User","site_admin":false},"created_at":"2015-02-26T05:24:53Z","updated_at":"2015-02-26T05:24:53Z","body":"Created a Bayes' net from spanning tree with UNCONDITIONAL probabilities on each node.  Stuck on how to generate directed path to find conditional probabilities.\r\n\r\nDo we just have to pick a root and iterate through all the connections?  There has to be a better way I'm missing.\r\n\r\nI did try experimenting with ng.all_simple_paths() but the best method for use wasn't super clear to me."}}