7 sys.path.append('/home/naath/familyTreeProject/familyTree')
9 import askQuestion as aQ
11 def add_parents(ID,name,startLevel,stopLevel):
13 startLevel = startLevel + 1
14 if int(startLevel) == int(stopLevel)+1:
18 [parents, parentIDs,parentNames] = aQ.find_parents(ID)
21 for i in range(len(parents)):
25 if not d.has_node(newName):
27 add_parents(newID,newName,\
33 d.add_marriage(pair[0], pair[1],[name],1)
35 def find_oneside_path(ID,start,stop):
43 [parents, parentIDs,parentNames] = aQ.find_parents(ID)
49 for i in range(len(parents)):
52 find_oneside_path(newID,start,stop)
54 def find_path(ID,ID2,LA,LB):
60 find_oneside_path(ID,0,int(LA))
65 find_oneside_path(ID2,0,int(LB))
70 cA = set(aP).intersection(set(bP))
79 [parents, parentIDs,parentNames] = aQ.find_parents(c)
80 s = aQ.find_person(c)[0]
82 d.add_marriage(parents[0],parents[1],[s],1)
88 [parents, parentIDs,parentNames] = aQ.find_parents(c)
89 s = aQ.find_person(c)[0]
91 d.add_marriage(parents[0],parents[1],[s],1)
98 [parents, parentIDs,parentNames] = aQ.find_parents(c)
99 s = aQ.find_person(c)[0]
101 d.add_marriage(parents[0],parents[1],[s],1)
104 [parents, parentIDs,parentNames] = aQ.find_parents(c)
105 s = aQ.find_person(c)[0]
107 d.add_marriage(parents[0],parents[1],[s],1)
109 def make_graph(ID,ID2,LA,LB):
113 find_path(ID,ID2,LA,LB)
116 # [Self, selfID, selfName] = aQ.find_person(ID)
117 # d.add_highlight(Self)
118 # add_parents(selfID,Self,0,LA)
121 # [Self, selfID, selfName] = aQ.find_person(ID2)
122 # d.add_highlight(Self)
123 # add_parents(selfID,Self,0,LB)
130 form = cgi.FieldStorage()
132 ID = form.getvalue('id')
133 ID2 = form.getvalue('id2')
134 LA = form.getvalue('LA')
135 LB = form.getvalue('LB')
138 make_graph(ID,ID2,LA,LB)