def init_graph():
"init the graph and image panel"
dot = Digraph()
dot.name = "topology"
dot.format = "gif"
dot.filename = "zigbee_topology"
return dot
def init_graph():
"init the graph and image panel"
dot = Digraph()
dot.name = "topology"
dot.format = "gif"
dot.filename = "zigbee_topology"
return dot
def visualize(self, filename, path):
digraph = Digraph(comment="Model")
for id in self.nodes:
node = self.nodes[id]
digraph.node(str(id), label=f'id:{id} rank:{node.rank} shape: {node.shape}')
for id in self.edges:
edge = self.edges[id]
digraph.edge(str(edge.src), str(edge.dest), label="id" if edge.identical else str(edge.as_layer()))
digraph.format='svg'
digraph.filename=filename
digraph.directory=path
digraph.render(view=False)
def parse(input):
try:
global dot
dot = Digraph('AST')
dot.filename = 'AST'
dot.format = 'png'
lexer.lineno = 0
instructions = yacc.yacc().parse(input)
dot.render()
return instructions
except Exception as e:
print(e)
return None
def visualize(self, path, filename):
digraph = Digraph(comment="Model")
for nid, node in self._nodes.items():
node = self.id_to_node(nid)
digraph.node(str(nid), label=f'{nid}: {node}')
for prev, next_list in self._adjacent_fwd.items():
for next in next_list:
eid = self._adjacent_fwd[prev][next]
edge = self.id_to_edge(eid)
digraph.edge(str(prev), str(next), label=f'{eid}: {edge}')
digraph.format = 'svg'
digraph.filename = filename
digraph.directory = path
digraph.render(view=False)
))
#if choice in dictionary:
if (choice == 1):
data = int(raw_input("\nEnter data to be inserted"))
newNode = tree.createNode(data)
tree.root = tree.insert(newNode, tree.root)
elif (choice == 2):
tree.inorder(tree.root)
elif (choice == 3):
tree.preorder(tree.root)
elif (choice == 4):
tree.postorder(tree.root)
elif (choice == 5):
print("Height:", tree.height(tree.root))
elif (choice == 6):
#fp.write("digraph {")
if tree.root != None:
d.name = "Binary_Search_Tree"
d.filename = "RenderedBST.gv"
d.node(str(tree.root.data))
tree.drawBST(tree.root, d)
d.render()
print("\n\n Tree drawn Successfully")
sys.exit()
else:
print("Tree is empty.")
elif (choice == 7):
tree.reverse(tree.root)
else:
sys.exit()
ch = int(raw_input("Enter choice:"))
if(ch == 1):
data = int(raw_input("Enter new node data"))
#insertionOrder.append(data)
myTree.root = myTree.insert(myTree.root,Node(data))
dummy.root = dummy.normalInsert(dummy.root,Node(data))
elif ch == 2:
myTree.inorder(myTree.root)
elif ch == 3:
print myTree.height(myTree.root)
elif ch == 4:
if myTree.root == None:
print "Tree is empty"
else:
z = 0
avl.name = "AVL_Tree"
avl.filename = "avlTree.gv"
avl.node(str(myTree.root.data))
myTree.drawTree(myTree.root,avl,z)
avl.render()
z = 0
binary.name = "Unbalanced_Tree"
binary.filename = "unbalanced.gv"
binary.node(str(dummy.root.data))
dummy.drawTree(dummy.root,binary,z)
binary.render()
else:
sys.exit()
