if node not in self.head_nodes:
self.head_nodes.append(node)
- for edge in rest_edges:
- if edge[0]==node:
- self.head_component(edge[1],rest_edges)
+ for edge in rest_edges:
+ if edge[0]==node:
+ self.head_component(edge[1],rest_edges)
def process_ranking(self, node, level=0):
if self.start_nodes:
#add dummy edges to the nodes which does not have any incoming edges
tree = self.make_acyclic(None, self.start_nodes[0], 0, [])
+
for node in self.no_ancester:
for sec_node in self.transitions.get(node, []):
if sec_node in self.partial_order.keys():
for l in self.levels:
result += 'PosY: ' + str(l) + '\n'
for node in self.levels[l]:
- result += '\tPosX: '+ str(self.result[node]['y']) + ' - Node:' + node + "\n"
+ result += '\tPosX: '+ str(self.result[node]['y']) + ' - Node:' + str(node) + "\n"
return result
for name,node in node_res.items():
draw.arc( (int(node['y']-radius), int(node['x']-radius),int(node['y']+radius), int(node['x']+radius) ), 0, 360, (128,128,128))
- draw.text( (int(node['y']), int(node['x'])), name, (128,128,128))
+ draw.text( (int(node['y']), int(node['x'])), str(name), (128,128,128))
for t in transitions: