-
Notifications
You must be signed in to change notification settings - Fork 2
/
tigraphs.py
279 lines (224 loc) · 8.15 KB
/
tigraphs.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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
# -*- coding: utf-8 -*-
import numpy as np
import igraph as ig
class BasicNode: # should be interfaced to a graph object
def __init__(self, labels=None):
self.incident_edges = set([])
self.incident_outward_edges = set([])
self.incident_inward_edges = set([])
if labels is None:
self.labels = set([])
else:
self.labels = labels
def add_edge(self, Edge):
if self in Edge.ends:
self.incident_edges.add(Edge)
if Edge.source() == self:
self.incident_outward_edges.add(Edge)
else:
self.incident_inward_edges.add(Edge)
else:
print('Cannot add edge to vertex, vertex not in ends.')
def remove_edge(self, Edge):
self.incident_edges.discard(Edge)
def add_label(self, label):
self.labels.add(label)
def remove_label(self, label):
self.labels.discard(label)
class BasicEdge: # should be interfaced to from a graph object
def __init__(self, ends=[], labels=None):
self.ends = ends
if labels is None:
self.labels = set([])
else:
self.labels = labels
def source(self):
return self.ends[0]
def target(self):
return self.ends[1]
def add_label(self, label):
self.labels.add(label)
def remove_label(self, label):
self.labels.discard(label)
def update_up(class_method):
def inner(self, *args, **kwargs):
method_name = class_method
class_method(self, *args, **kwargs)
for Supergraph in self.supergraphs:
getattr(Supergraph, method_name)(*args, **kwargs)
return inner
def update_up_down(class_method):
def inner(self, *args, **kwargs):
method_name = class_method
if class_method(self, *args, **kwargs):
for Supergraph in self.supergraphs:
getattr(Supergraph, method_name)(*args, **kwargs)
for Subgraph in self.subgraphs:
getattr(Subgraph, method_name)(*args, **kwargs)
return inner
class Graph(object):
def __init__(self, subgraphs=None, supergraphs=None, vertices=None, edges=None, Vertex=BasicNode, Edge=BasicEdge):
if edges == None:
edges = []
self.edges = set(edges)
if vertices == None:
vertices = []
self.vertices = vertices
if subgraphs == None:
subgraphs = []
self.subgraphs = set(subgraphs)
if supergraphs == None:
supergraphs = []
self.supergraphs = set(supergraphs)
for Supergraph in supergraphs:
Supergraph.add_subgraph(self)
for Subgraph in subgraphs:
Subgraph.add_supergraph(self)
self.vertex_dict = {}
self.edges_dict = {}
self.Vertex = Vertex
self.Edge = Edge
@update_up
def create_vertex(self):
self.vertices.append(self.Vertex())
def create_vertices(self, no_create):
for i in range(no_create):
self.create_vertex()
@update_up
def add_vertex(self, Vertex):
if Vertex in self.vertices:
return
self.vertices.append(Vertex)
@update_up
def create_edge(self, ends):
NewEdge = self.Edge(ends=ends)
self.edges.add(NewEdge)
for Vertex in ends:
Vertex.add_edge(NewEdge)
@update_up_down
def remove_edge(self, Edge):
if not Edge in self.edges:
return False
self.edges.discard(Edge)
return True
def get_incident_edges(self, Vertex):
incident_edges = Vertex.incident_edges & self.edges
return incident_edges
@update_up_down
def remove_vertex(self, Vertex):
if Vertex not in self.vertices:
return False
edges_to_remove = self.get_incident_edges(Vertex)
for Edge in edges_to_remove:
self.remove_edge(Edge)
self.vertices.remove(Vertex)
return True
def get_degree(self, Vertex):
return len(self.get_incident_edges(Vertex))
def get_number_vertices(self):
return len(self.vertices)
def get_adjacency_matrix(self):
adj_list = [self.get_adjacency_list_of_vertex(Vertex) for Vertex in self.vertices]
# adj_list = map(lambda x: self.get_adjacency_list_of_vertex(x), self.vertices)
adj_mat = np.array(adj_list)
return adj_mat
def get_adjacency_matrix_as_list(self):
return self.get_adjacency_matrix().tolist()
def add_subgraph(self, Subgraph):
self.subgraphs.add(Subgraph)
def add_supergraph(self, Supergraph):
self.supergraphs.add(Supergraph)
def get_incident_outward_edges(self, Vertex):
return (Vertex.incident_outward_edges & self.edges)
def add_vertex_label(self, vertex, label):
self.vertex_dict[label] = vertex
vertex.add_label(label)
def get_vertex(self, label):
if label in self.vertex_dict.keys():
return self.vertex_dict[label]
else:
return None
def remove_vertex_label(self, label):
vertex = self.vertex_dict.pop(label, 'Not Found')
if vertex == 'Not Found':
return
else:
vertex.remove_label(label)
def get_incident_outward_edges(self, Vertex):
return (Vertex.incident_outward_edges & self.edges)
def get_adjacency_list_of_vertex(self, Vertex):
N = self.get_number_vertices()
adj_list = [0 for x in range(N)]
incident_edges = self.get_incident_outward_edges(Vertex)
for Edge in incident_edges:
target = Edge.target()
index = self.vertices.index(target)
adj_list[index] += 1
return adj_list
def set_adjacency_matrix(self, adj_mat):
shape = np.shape(adj_mat)
if shape[0] != shape[1]:
print('Wrong shape, expecting square matrix.')
return
n = shape[0]
self.vertices = []
self.edges = []
self.create_vertices(n)
for row, col in range(n):
no_edges = adj_mat[row, col]
Source = self.vertices[row]
Target = self.vertices[col]
for Edge in range(no_edges):
self.create_edge(ends=[Source, Target])
def plot(self):
A = self.get_adjacency_matrix_as_list()
convert_to_igraph = ig.Graph.Adjacency(A)
ig.plot(convert_to_igraph)
def return_tree_class(directed):
class Tree(Graph, object):
def __init__(self, N=0, **kwargs):
super().__init__(**kwargs)
self.leaves = set([])
self.find_leaves()
self.N = N
def is_leaf(self, vertex):
if self.get_degree(vertex) == 1:
return True
elif self.get_number_vertices() == 1:
return True
else:
return False
def set_root(self, vertex):
if vertex in self.vertices:
self.remove_vertex_label('Root')
self.add_vertex_label(vertex, label='Root')
def get_root(self):
return self.get_vertex('Root')
def find_leaves(self):
self.leaves = set(filter(self.is_leaf, self.vertices))
return [leaf for leaf in self.leaves]
def split_vertex(self, vertex):
if vertex in self.leaves:
children = [self.Vertex() for i in range(self.N)]
vertex.children = children
self.leaves.discard(vertex)
for Child in children:
self.add_vertex(Child)
self.leaves.add(Child)
Child.parent = vertex
self.create_edge(ends=[vertex, Child])
def fuse_vertex(self, vertex):
self.leaves.add(vertex)
try:
children = vertex.children
except AttributeError:
return
if children == None:
return
for child in children:
self.fuse_vertex(child)
self.leaves.discard(child)
self.remove_vertex(child)
child.parent = None
vertex.children = None
return Tree