在Python中使用GraphViz绘制二叉排序树
本文章结合了py和Graphviz,想要快速可视化二叉排序树和想要初步了解Graphviz的小伙伴可以看看。
准备工作:
1.在GraphViz官网下载文件后,在电脑安装,并将安装路径导入环境变量PATH
2.进入cmd,输入 pip install graphviz
实现代码
# python 实现二叉树
# author E
import queue
from graphviz import Digraph
class Node(object):
def __init__(self, data = None, parent = None):
self.data = data
self.parent = parent
self.right = None
self.left = None
class BinaryTree(object):
def __init__(self, list):
self.root = Node()
for ele in list:
self.insert(ele, self.root)
def insert(self, x, r):
if r.data == None:
self.root.data = x
if x < r.data:
if r.left == None:
r.left = Node(x, r)
else:
self.insert(x, r.left)
if x > r.data:
if r.right == None:
r.right = Node(x, r)
else:
self.insert(x, r.right)
def layerOrder(self):
# 初始化队列
q = queue.Queue()
q.put(self.root)
while(q.empty() != True):
node = q.get()
print(node.data)
if node.left != None:
q.put(node.left)
if node.right != None:
q.put(node.right)
def drawPic(self):
dot = Digraph(comment='The Test Table')
q = queue.Queue()
q.put(self.root)
while(q.empty() != True):
node = q.get()
dot.node(name = str(node.data), lable = str(node.data))
if node.left != None:
dot.node(name = str(node.left.data), lable = str(node.left.data))
dot.edge(str(node.data), str(node.left.data))
q.put(node.left)
else:
#生成空节点invisl,让生成的二叉树可以分清左右子树
dot.node(name = str(node.data)+'invisl', lable = str(node.data)+'invisl', style = 'invis')
dot.edge(str(node.data), str(node.data)+'invisl', style = 'invis')
#生成空节点invism,让生成的二叉树可以分清左右子树
dot.node(name = str(node.data)+'invism', lable = str(node.data)+'invism', style = 'invis')
dot.edge(str(node.data), str(node.data)+'invism', style = 'invis')
if node.right != None:
dot.node(name = str(node.right.data), lable = str(node.right.data))
dot.edge(str(node.data), str(node.right.data))
q.put(node.right)
else:
#生成空节点invisr,让生成的二叉树可以分清左右子树
dot.node(name = str(node.data)+'invisr', lable = str(node.data)+'invisr', style = 'invis')
dot.edge(str(node.data), str(node.data)+'invisr', style = 'invis')
dot.view()
dot.render('tmp.gv', view=True)
def getRoot(self):
return self.root
if __name__ == '__main__':
tree = BinaryTree([7, 2, 9, 10, 11, 5, 8, 4, 14, 1, 12])
#tree.layerOrder()
tree.drawPic()
主要思路是用递归生成二叉排序树,再通过层序遍历绘制图形。将需要生成树的列表传入BinaryTree的构造函数,再调用drawPic方法输出。平常C++用的多,python写的比较烂,大家见谅。