An error occurred while loading the file. Please try again.
-
Pierre-Antoine Rouby authored7fd570c5
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
# test_Network.py -- Pamhyr
# Copyright (C) 2023 INRAE
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <https://www.gnu.org/licenses/>.
# -*- coding: utf-8 -*-
import os
import unittest
import tempfile
from Model.Saved import SavedStatus
from Model.Network.Graph import Graph
from Model.Network.Edge import Edge
from Model.Network.Node import Node
def new_graph():
status = SavedStatus()
g = Graph(status=status)
return g
class GraphTestCase(unittest.TestCase):
def test_graph_0(self):
g = new_graph()
self.assertEqual(g.nodes_counts(), 0)
self.assertEqual(g.edges_counts(), 0)
def test_graph_1(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
e0 = g.add_edge(n0, n1)
self.assertEqual(g.nodes_counts(), 2)
self.assertEqual(g.edges_counts(), 1)
def test_graph_2(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
e0 = g.add_edge(n0, n1)
g.remove_edge(e0.name)
self.assertEqual(g.nodes_counts(), 2)
self.assertEqual(g.edges_counts(), 0)
def test_graph_3(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
e0 = g.add_edge(n0, n1)
g.remove_node(n0.name)
self.assertEqual(g.nodes_counts(), 1)
self.assertEqual(g.edges_counts(), 0)
def test_graph_4(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n1, n2)
g.remove_node(n1.name)
self.assertEqual(g.nodes_counts(), 2)
self.assertEqual(g.edges_counts(), 0)
def test_graph_upstream_0(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n1, n2)
self.assertEqual(g.is_upstream_node(n0), True)
self.assertEqual(g.is_upstream_node(n1), False)
self.assertEqual(g.is_upstream_node(n2), False)
def test_graph_upstream_1(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n2, n1)
self.assertEqual(g.is_upstream_node(n0), True)
self.assertEqual(g.is_upstream_node(n1), False)
self.assertEqual(g.is_upstream_node(n2), True)
def test_graph_upstream_disable(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n1, n2)
e0.disable()
# self.assertEqual(g.is_upstream_node(n0), False)
self.assertEqual(g.is_upstream_node(n1), True)
self.assertEqual(g.is_upstream_node(n2), False)
def test_graph_downstream_0(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n1, n2)
self.assertEqual(g.is_downstream_node(n0), False)
self.assertEqual(g.is_downstream_node(n1), False)
self.assertEqual(g.is_downstream_node(n2), True)
def test_graph_downstream_1(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n2, n1)
self.assertEqual(g.is_downstream_node(n0), False)
self.assertEqual(g.is_downstream_node(n1), True)
self.assertEqual(g.is_downstream_node(n2), False)
def test_graph_downstream_disable(self):
g = new_graph()
n0 = g.add_node()
n1 = g.add_node()
n2 = g.add_node()
e0 = g.add_edge(n0, n1)
e1 = g.add_edge(n1, n2)
e1.disable()
self.assertEqual(g.is_downstream_node(n0), False)
self.assertEqual(g.is_downstream_node(n1), True)
# self.assertEqual(g.is_downstream_node(n2), False)