An error occurred while loading the file. Please try again.
-
Pierre-Antoine Rouby authored6ad369bb
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
# -*- coding: utf-8 -*-
from functools import reduce
class Node(object):
def __init__(self, id:str, name:str):
super(Node, self).__init__()
self.id = id
self.name = name
def __repr__(self):
return f"Node {{id: {self.id}, name: {self.name}}}"
def __getitem__(self, name):
ret = None
if name == "name":
ret = self.name
elif name == "id":
ret = self.id
return ret
class Edge(object):
def __init__(self, id:str, name:str, node1:Node = None, node2:Node = None):
super(Edge, self).__init__()
self.id = id
self.name = name
self.node1 = node1
self.node2 = node2
self.enable = True
def __repr__(self):
return f"Edge {{id: {self.id}, enable: {self.enable}, name: {self.name}, self.node1: {self.node1}, self.node2: {self.node2},}}"
def __getitem__(self, name):
ret = None
if name == "name":
ret = self.name
elif name == "id":
ret = self.id
elif name == "node1":
ret = self.node1.name
elif name == "node2":
ret = self.node2.name
elif name == "enable":
ret = self.enable
return ret
def enable(self):
self.enable = True
def disable(self):
self.enable = False
class Graph(object):
def __init__(self):
super(Graph, self).__init__()
self._nodes_ids = 0
self._edges_ids = 0
self._nodes = []
self._edges = []
def __repr__(self):
return f"Graph {{nodes: {self._nodes}, edges: {self._edges}}}"
def nodes(self):
return self._nodes.copy()
def edges(self):
return self._edges.copy()
def nodes_counts(self):
return len(self._nodes)
def edges_counts(self):
return len(self._edges)
def is_node_exists(self, node_name):
return reduce(
lambda acc, n: (acc or (n.name == node_name)),
self._nodes,
False
)
def is_edge_exists(self, edge_name):
return reduce(
lambda acc, e: (acc or (e.name == edge_name)),
self._edges,
False
)
def add_node(self):
node = Node(self._nodes_ids, f"Node {self._nodes_ids}")
self._nodes.append(node)
self._nodes_ids += 1
return node
def add_edge(self, n1:Node, n2:Node):
edge = Edge(self._edges_ids, f"Edge {self._edges_ids}", n1, n2)
self._edges.append(edge)
self._edges_ids += 1
return edge
def remove_node(self, node_name:str):
self._nodes = filter(lambda n: n.name != node_name, self._nodes)
def remove_edge(self, edge_name:str):
self._edges = filter(lambda e: e.name != edge_name, self._edges)