-
Notifications
You must be signed in to change notification settings - Fork 4
/
template.py
453 lines (412 loc) · 11.9 KB
/
template.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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
from __future__ import print_function
__author__ = 'george'
import os, sys, json
sys.path.append(os.path.abspath("."))
sys.dont_write_bytecode = True
def decode(input):
if isinstance(input, dict):
return {decode(key):decode(value) for key,value in input.iteritems()}
elif isinstance(input, list):
return [decode(element) for element in input]
elif isinstance(input, unicode):
return input.encode('utf-8')
else:
return input
class O(object):
"""
Default class that gives
kwargs properties
"""
def __init__(self,**d): self.has().update(**d)
def has(self): return self.__dict__
def update(self,**d): self.has().update(d); return self
def __repr__(self) :
def _name(val):
if isinstance(val, list):
return [v for v in val]
if hasattr(val, '__call__'):
return val.__name__
return val
show=[':%s %s' % (k,_name(self.has()[k]))
for k in sorted(self.has().keys() )
if k[0] is not "_"]
txt = ' '.join(show)
if len(txt) > 60:
show=map(lambda x: '\t'+x+'\n',show)
return '{'+' '.join(show)+'}'
def __getitem__(self, item):
return self.has().get(item, None)
def __getattr__(self, item):
return self.has().get(item, None)
def to_json(self):
def dflt(obj):
if isinstance(obj, set): return list(obj)
return obj.__dict__
return json.dumps(self, default=dflt, sort_keys=True, indent=4)
def clone(self):
cloned = O()
for key, val in self.has().iteritems():
cloned.__dict__[key] = val
return cloned
class Component(O):
"""
All components of graph
should extend this class
"""
id = 0
def __init__(self, component, **kwargs):
O.__init__(self, **kwargs)
self.id = Component.id
self.component = component
Component.id += 1
def __hash__(self):
if not self.id:
return 0
return hash(self.id)
def __eq__(self, other):
if not self.id or not other.id:
return False
return self.id == other.id
class Node(Component):
"""
Node of a graph
"""
def __init__(self, name, type, **kwargs):
Component.__init__(self, "node", name=name, type=type, **kwargs)
self.from_edges = []
self.to_edges = []
self.is_random = False
self.cost = 0
self.weighted_cost = 0
def add_edge(self, edge_id, type):
if type == "from":
self.from_edges.append(edge_id)
else:
self.to_edges.append(edge_id)
class Task(Node):
"""
A Task node.
"""
def __init__(self, name, container=None, **kwargs):
Node.__init__(self, name, "task", container=container, **kwargs)
class Resource(Node):
"""
A resource node
"""
def __init__(self, name, container=None, **kwargs):
Node.__init__(self, name, "resource", container=container, **kwargs)
class SoftGoal(Node):
"""
A Soft goal node
"""
def __init__(self, name, container=None, **kwargs):
Node.__init__(self, name, "softgoal", container=container, **kwargs)
class HardGoal(Node):
"""
A Hard Goal Node
"""
def __init__(self, name, container=None, **kwargs):
Node.__init__(self, name, "goal", container=container, **kwargs)
class Edge(Component):
"""
Edge of a graph
"""
def __init__(self, source, target, **kwargs):
Component.__init__(self, "edge", **kwargs)
self.source = source.id
self.target = target.id
@staticmethod
def get_contribution_weight(key):
if key == "make":
return +3
elif key == "help":
return +2
elif key == "someplus":
return +1
elif key == "someminus":
return -1
elif key == "hurt":
return -2
elif key == "break":
return -3
raise RuntimeError("Invalid contribution type %s"%key)
class Make(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "make"
self.type = "contribution"
class Help(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "help"
self.type = "contribution"
class SomePlus(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "someplus"
self.type = "contribution"
class SomeMinus(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "someminus"
self.type = "contribution"
class Hurt(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "hurt"
self.type = "contribution"
class Break(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "break"
self.type = "contribution"
class Conflict(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "conflict"
self.type = "contribution"
class And(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "and"
self.type = "decompositions"
class Or(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "or"
self.type = "decompositions"
class Dep(Edge):
"""
Make Contribution edge.
"""
def __init__(self, source, target, **kwargs):
Edge.__init__(self, source, target, **kwargs)
self.value = "dependency"
self.type = "dependency"
class Many:
"""
An Array object
"""
def __init__(self):
self.all = []
def __add__(self, other):
self.all.append(other)
return other
class Graph(O):
"""
Graph object
"""
def __init__(self, name, nodes, edges):
O.__init__(self, name=name, nodes=nodes, edges=edges)
self.update_nodes()
def update_nodes(self):
node_map = {}
count = 0
for node in self.nodes:
node_map[node.id] = node
for edge in self.edges:
source = node_map.get(edge.source, None)
target = node_map.get(edge.target, None)
if source is None or target is None:
count +=1;
continue
node_map[edge.source].add_edge(edge.id, "to")
node_map[edge.target].add_edge(edge.id, "from")
#if count: print(count)
def get_edge(self, edge_id):
for edge in self.edges:
if edge.id == edge_id:
return edge
return None
def get_node(self, node_id):
for node in self.nodes:
if node.id == node_id:
return node
return None
def get_bases(self):
"""
Get the base decisions of the graph
:return:
"""
nodes = []
for node in self.nodes:
if node.type in ['task', 'resource']:
# We assume that decisions are either tasks or resources
if not node.from_edges:
nodes.append(node)
return nodes
def get_leaves(self):
"""
Get the leaves of the graph
:return:
"""
nodes = []
for node in self.nodes:
if not node.from_edges and len(node.to_edges) > 0:
nodes.append(node)
return nodes
def get_roots(self):
"""
Get roots of the tree
:return:
"""
nodes = []
for node in self.nodes:
if not node.to_edges:
nodes.append(node)
return nodes
def get_nodes_covered(self):
return [node for node in self.get_nodes() if node.value]
def get_nodes(self, node_type=None):
"""
Get nodes of a certain type
:param node_type:
:return:
"""
if isinstance(node_type, list):
return [node for node in self.nodes if node.type in node_type]
elif isinstance(node_type, str):
return [node for node in self.nodes if node.type in [node_type]]
else: return self.nodes
@staticmethod
def json(graph, file_path=None):
if file_path:
fl = open(file_path, 'w+')
fl.write(graph.to_json())
fl.close()
else:
print(graph.to_json())
@staticmethod
def read(file_path):
with open(file_path) as json_file:
data = decode(json.load(json_file))
nodes, edges = [],[]
for node_json in data["nodes"]:
node_name = node_json["name"]
container = node_json["container"]
type = node_json["type"]
node = Node(node_name, type, container=container)
node.id = node_json["id"]
nodes.append(node)
for edge_json in data["edges"]:
edge = Component("edge")
edge.id = edge_json["id"]
edge.value = edge_json["value"]
edge.type = edge_json["type"]
edge.source = edge_json["source"]
edge.target = edge_json["target"]
edges.append(edge)
return Graph(name=data["name"], nodes=nodes, edges=edges)
@staticmethod
def from_dot(graph_name, path, resources=[], containers=[]):
def trim(str):
return str[1:-1]
import pydot
graph = pydot.graph_from_dot_file(path)
graph_nodes = graph.get_node_list()
nodes = []
for graph_node in graph_nodes:
name = trim(graph_node.get_name())
if name in resources:
node = Resource(name)
elif name in containers:
continue
else:
shape = graph_node.get_attributes()["shape"]
if shape == "parallelogram":
node = HardGoal(name)
elif shape == "polygon":
node = Task(name)
elif shape == "box":
node = SoftGoal(name)
elif shape in ["circle", "ellipse"]:
# containers
continue
else:
#print(name)
continue
node.id = node.name
nodes.append(node)
graph_edges = graph.get_edge_list()
edges = []
labels = set()
for graph_edge in graph_edges:
source = trim(graph_edge.get_source())
target = trim(graph_edge.get_destination())
if source in containers or target in containers:
continue
labels.add(graph_edge.get_attributes().get("label", None))
label = graph_edge.get_attributes().get("label", None)
if not label:
value = "or"
type = "decompositions"
elif "make" in label.lower():
value = "make"
type = "contribution"
elif "break" in label.lower():
value = "break"
type = "contribution"
elif "help" in label.lower():
value = "help"
type = "contribution"
elif "hurt" in label.lower():
value = "hurt"
type = "contribution"
elif "some +" in label.lower():
value = "someplus"
type = "contribution"
elif "some -" in label.lower():
value = "someminus"
type = "contribution"
elif "d" in label.lower():
value = "dependency"
type = "dependency"
source, target = target, source
else:
#print(source, target, label)
continue
edge = Component("edge")
edge.value = value
edge.type = type
edge.source = source
edge.target = target
edges.append(edge)
return Graph(name=graph_name, nodes=nodes, edges=edges)
if __name__ == "__main__":
resources = ["Service Resources", "Web Server", "Feedback Form Software", "Web Software",
"Strategic Blue Print", "Feedback", "Web Site Content", "Phone Library of Recorded Messages",
"Feedback1"]
containers = ["CS", "Fund Development and Marketing", "Provincial government",
"CS Technology Services", "CS Service", "Web Service", "Phone Service",
"Counselling Management", "PHL Service", "Parents", "IT Department",
"Web Task Force", "CS Web Services", "CS Phone Services", "PHL Phone Services",
"PHL Web Services", "Counselling", "Kids and Youth"]
graph = Graph.from_dot("CSServices", "pystar/CSServices.gv", resources, containers)
Graph.json(graph, "pystar/json/%s.json"%graph.name)