-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph_c.pyx
More file actions
214 lines (168 loc) · 5.28 KB
/
graph_c.pyx
File metadata and controls
214 lines (168 loc) · 5.28 KB
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
#-*- coding: utf-8 -*-
class Graph(object):
def __init__(self, vertexes=None, edges=None):
if not vertexes: vertexes = []
if not edges: edges = []
self._vertex = vertexes
self._edge = edges
if self._edge:
self.remove_imaginary_edge()
def remove_imaginary_edge(self):
for fromVertex in self._vertex:
for toVertex in self._vertex:
edge = self.get_edge(fromVertex, toVertex)
if not fromVertex == toVertex and edge:
time = fromVertex.data._startArrive + fromVertex.data._taskTime + edge.length
if time > toVertex.data._endArrive:
self._edge.remove(edge)
def add_vertex(self, vertex):
self._vertex.append(vertex)
for edge in vertex.edges:
if not ({edge.beginVertex, edge.endVertex} - set(self._vertex)):
self._edge.append(edge)
self._edge = list(set(self._edge))
def add_edge(self, edge):
if edge.is_valid():
self._edge.append(edge)
def remove_vertex(self, vertex):
if vertex in self._vertex:
vertex.isValid = False
self._vertex.remove(vertex)
begin = []
end = []
for e in reversed(self._edge):
if vertex in (e.beginVertex, e.endVertex):
if vertex == e.beginVertex:
end.append(e.endVertex)
if vertex == e.endVertex:
begin.append(e.beginVertex)
self._edge.remove(e)
for b in begin:
for e in end:
edge = self.get_edge(b, e)
if b <> e and edge and not edge in self._edge:
self._edge.append(edge)
def remove_edge(self, edge):
if edge in self._edge:
self._edge.remove(edge)
def remove_edge(self, index):
if index < len(self._edge):
self._edge.remove(self._edge[index])
def get_vertex(self, index):
if index < self.get_vertex_count():
return self._vertex[index]
else:
return self._vertex[-1]
def get_edge(self, begin, end):
if not begin == end and not ({begin, end} - set(self._vertex)):
for edge in begin.outEdge:
if edge.endVertex == end:
return edge
return None
def get_vertex_count(self):
return len(self._vertex)
def get_edge_count(self):
return len(self._edge)
def __iter__(self):
for vertex in self._vertex:
yield vertex
class Vertex(object):
def __init__(self, data=None, outEdges=None, inEdges=None, coordinate=None):
if not outEdges: outEdges = []
if not inEdges: inEdges = []
if not coordinate: coordinate = ()
self.__coord = coordinate
self.__inEdge = inEdges
self.__outEdge = outEdges
self.isValid = True
self.__allEdge = self.__inEdge + self.__outEdge
self.__data = data
def __eq__(self, other):
return self.data == other.data if other else False
def __ne__(self, other):
return self.data <> other.data if other else False
def __hash__(self):
return hash(self.__data)
def __repr__(self):
return self.__data._name.encode('utf-8')
def add_input_edge(self, edge):
if edge.is_valid() and edge.endVertex == self:
self.__inEdge.append(edge)
self.__allEdge.append(edge)
def add_output_edge(self, edge):
if edge.is_valid() and edge.beginVertex == self:
self.__outEdge.append(edge)
self.__allEdge.append(edge)
def add_edge(self, edge):
self.__allEdge.append(edge)
if edge.beginVertex == self:
self.__outEdge.append(edge)
else:
self.__inEdge.append(edge)
def remove_edge(self, edge):
if edge in self.edges:
self.__allEdge.remove(edge)
if edge in self.inEdge:
self.__inEdge.remove(edge)
else:
self.__outEdge.remove(edge)
def __getitem__(self, index):
return self.__allEdge[index]
def edge_count(self):
return len(self.__inEdge)
@property
def edges(self):
return self.__allEdge
@property
def inEdge(self):
return self.__inEdge
@property
def outEdge(self):
return self.__outEdge
@property
def data(self):
return self.__data
class Edge(object):
def __init__(self, start=None, end=None, length=0):
self.__beginVertex = start
self.__endVertex = end
self.__len = length
self.__isValid = True
self.__beginVertex.add_output_edge(self)
self.__endVertex.add_input_edge(self)
@property
def isValid(self):
return self.__isValid
@isValid.setter
def isValid(self, val):
self.__isValid = val
@property
def endVertex(self):
return self.__endVertex
@endVertex.setter
def endVertex(self, vertex):
self.__endVertex = vertex
@property
def beginVertex(self):
return self.__beginVertex
@beginVertex.setter
def beginVertex(self, vertex):
self.__beginVertex = vertex
@property
def length(self):
return self.__len
@length.setter
def length(self, length):
self.__len = length
def is_valid(self):
return self.beginVertex and self.endVertex and self.__isValid
def __eq__(self, other):
return (self.__beginVertex, self.__endVertex, self.__len) == (
other.__beginVertex, other.__endVertex, other.__len)
def __hash__(self):
return hash(
(self.__len, self.__beginVertex.data._name, self.__endVertex.data._name))
def __repr__(self):
return self.beginVertex.data._name.encode('utf-8') + \
' ---' + str(self.__len) + '---> ' + \
self.endVertex.data._name.encode('utf-8')