gem-graph/gem-graph-client
gem-graph
/
gem-graph-client
3
0
Fork 0
Code Issues 14 Pull Requests Projects Releases Activity

Conditions Tree: first blueprint using anytree (iteratively)

This commit is contained in:
Jean Sirmai 2022-01-06 12:31:21 +01:00
parent 9e327a2643
commit 4cec4b1855
Signed by: jean
GPG Key ID: FB3115C340E057E3
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/rules_tree.py
View File

@ -17,6 +17,7 @@ for i in range(0, len(model.testmodel.get_conditions().get_conditions_array())):
condition.get_site(), condition.get_site(),
condition.get_weight())) condition.get_weight()))
class CondTreeNode(NodeMixin): class CondTreeNode(NodeMixin):
def __init__(self, id, x, site, weight, parent_node_id): def __init__(self, id, x, site, weight, parent_node_id):
super(CondTreeNode, self).__init__() super(CondTreeNode, self).__init__()
@ -31,12 +32,13 @@ class CondTreeNode(NodeMixin):
self.parent = parent_node self.parent = parent_node
print('orphan node ', self.id, ' is adopted by node ', parent_node.id) print('orphan node ', self.id, ' is adopted by node ', parent_node.id)
for i in conditions_set: # sorted(conditions_set, key=i.id): for i in conditions_set: # sorted(conditions_set, key=i.id):
condition = CondTreeNode(i[0], i[2], i[3], i[4], i[1]) # TODO y,z,... condition = CondTreeNode(i[0], i[2], i[3], i[4], i[1]) # TODO y,z,...
conditions_list.append(condition) conditions_list.append(condition)
for i in conditions_list: for i in conditions_list:
if (i.parent == None): if (i.parent is None):
for j in conditions_list: for j in conditions_list:
if (i.parent_node_id == j.id): if (i.parent_node_id == j.id):
i.add_parent_node(j) i.add_parent_node(j)