def get_newest(self, _id):
'''
gets the newest model and turns it into a graph.
'''
model_cursor= self.models.find({'id':str(_id)}).sort("entry_time", pymongo.DESCENDING).limit(1)#{'id':str(id), 'width':width, 'height':height})
# print pic
l=[]
for cur in model_cursor: l.append(cur)
return build_graph(yaml.load(json.dumps(l[-1][str(_id)])));
[[], {"A": float(1)/3, "B": float(1)/3, "C": float(1)/3}]],
"monty_door": [
[[["prize_door", "A"], ["contestant_door", "A"]], {"A": 0, "B": 0.5, "C": 0.5}],
[[["prize_door", "A"], ["contestant_door", "B"]], {"A": 0, "B": 0, "C": 1}],
[[["prize_door", "A"], ["contestant_door", "C"]], {"A": 0, "B": 1, "C": 0}],
[[["prize_door", "B"], ["contestant_door", "A"]], {"A": 0, "B": 0, "C": 1}],
[[["prize_door", "B"], ["contestant_door", "B"]], {"A": 0.5, "B": 0, "C": 0.5}],
[[["prize_door", "B"], ["contestant_door", "C"]], {"A": 1, "B": 0, "C": 0}],
[[["prize_door", "C"], ["contestant_door", "A"]], {"A": 0, "B": 1, "C": 0}],
[[["prize_door", "C"], ["contestant_door", "B"]], {"A": 1, "B": 0, "C": 0}],
[[["prize_door", "C"], ["contestant_door", "C"]], {"A": 0.5, "B": 0.5, "C": 0}],
]
}
g=build_graph(TRUTH)
def indep_wrap(varName, d={}, p=0.5):
d[varName]= [[[],{"H":p , "L":1.0-p}]]
return d
def one_cause_wrap(depVar, indepVar, d, p=0.5, neg=set()):
if indepVar not in neg:
d[depVar]=[
[[[indepVar, "H"]], {"H": p, "L": 1-p}],
[[[indepVar, "L"]], {"H": 0, "L": 1.0}]]
else:
d[depVar]=[
[[[indepVar, "H"]], {"H": 0, "L": 1.0}],
[[[indepVar, "L"]], {"H": p, "L": 1.0-p}]]
return d
