-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.py
184 lines (149 loc) · 5.27 KB
/
tree.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
import random
import pprint # prints good
class node(object):
def __init__(self, value, vol=1, children = []):
self.value = value
self.volume = vol
self.children = children or []
self.hash = random.randint(1, 100000001)
def __str__(self, level=0):
ret = "\t"*level+repr(self.value)+"\n"
for child in self.children:
ret += child.__str__(level+1)
return ret
def __repr__(self):
return '<{}>'.format(self.value)
######################################################################################
from copy import deepcopy
def leftistTree(node):
nodeCopy = deepcopy(node)
_leftistTree(nodeCopy)
return nodeCopy
def _leftistTree(node):
# node = deepcopy(nodeReal)
if node.children == []:
return
reagentIdx = [idx for idx, child in enumerate(node.children) if child.children == []]
vols = sorted([(idx, child.volume) for idx, child in enumerate(node.children) if child.children != []], key = lambda x: x[1], reverse = True)
temp = []
for item in vols:
temp.append(node.children[item[0]])
for item in reagentIdx:
temp.append(node.children[item])
node.children = temp
for child in node.children:
_leftistTree(child)
return
######################################################################################
def isSkewed(root):
'''
check if a tree in NODE data structure is skewed or not
'''
if root is None:
return True
if len(root.children) == 0:
return True
else:
next_root = []
for child in root.children:
if len(child.children) > 0:
next_root.append(child)
if len(next_root) == 0:
return True
elif len(next_root) > 1:
return False
else:
return isSkewed(next_root[0])
######################################################################################
def getNodesEdges(node):
'''
returns list of nodes and edges of a tree from NODE data structure
'''
nodelist = [(node.hash, node.value)]
edgelist = []
for child in node.children:
edgelist.append(((node.hash, node.value, node.volume), (child.hash, child.value, child.volume)))
temp_nodelist, temp_edgelist = getNodesEdges(child)
nodelist += temp_nodelist
edgelist += temp_edgelist
return nodelist, edgelist
import pydot
pp = pprint.PrettyPrinter(indent=4)
def _createTree(root, label=None):
'''
convert a tree from NODE data structure to Pydot Graph for visualisation
'''
P = pydot.Dot(graph_type='digraph', label=label, labelloc='top', labeljust='left')#, nodesep="1", ranksep="1")
nodelist, edgelist = getNodesEdges(root)
# print("EDGELIST")
# print(edgelist)
# print("NODELIST")
# print(nodelist)
# Nodes
for node in nodelist:
n = pydot.Node(node[0], label=node[1])
P.add_node(n)
# Edges
for edge in edgelist:
e = pydot.Edge(*(edge[0][0], edge[1][0]), label=edge[1][2], dir='back')
P.add_edge(e)
return P
###############################################################################################
#############################################################################################
from IPython.display import Image, display
def _viewPydot(pydot):
'''
generates a visual plot of Pydot Graph
'''
pydot.write_png("output.png")
pydot.write_raw("output_raw.dot")
plt = Image(pydot.create_png(prog='dot'))
display(plt)
def viewTree(root):
_viewPydot(_createTree(root))#takes P
import os
from utility import create_directory
def saveTree(root, save):
save = save.split('/')
dir_name = '/'.join(save[:-1])
if not save[-1].endswith('.png'):
file_name = save[-1] + '.png'
else:
file_name = save[-1]
create_directory(dir_name)
# plt.savefig(os.path.join(dir_name, file_name), #dpi = 128,
# bbox_inches = 'tight', pad_inches = 0)
_createTree(root).write_png(os.path.join(dir_name, file_name))
######################################################################################
def listToSkewTree(combination):
root = node('root')
root.volume = len(combination[-1])
temp = root
for idx, item in enumerate(combination):
for x in item:
temp.children.append(node(str(x)))
temp.value = 'M{}'.format(idx)
if idx < len(combination)-1:
temp.children.append(node('mixxx'))
temp = temp.children[-1]
temp.volume = len(combination[-1]) - len(item)
return root
######################################################################################
MIX_COUNTER = 0
def _listToTree(l):
if type(l) != list:
# print (l)
return node(str(l))
else:
global MIX_COUNTER
root = node('M{}'.format(MIX_COUNTER))
MIX_COUNTER += 1
root.volume = l[0] #if type(l[0]) == tuple else 1
for item in l[1:]:
root.children.append(_listToTree(item))
return root
def listToTree(l):
global MIX_COUNTER
MIX_COUNTER = 0
return _listToTree(l)
######################################################################################