def test_036(self):
algorithm = ActionDigraph.algorithm
ad = ActionDigraph()
ad.add_nodes(10)
ad.add_to_out_degree(20)
ad.add_edge(0, 7, 5)
ad.add_edge(0, 5, 7)
ad.add_edge(1, 9, 14)
ad.add_edge(1, 5, 17)
ad.add_edge(3, 8, 5)
ad.add_edge(5, 8, 1)
ad.add_edge(6, 8, 14)
ad.add_edge(7, 8, 10)
ad.add_edge(8, 9, 12)
ad.add_edge(8, 9, 13)
self.assertTrue(is_acyclic(ad))
self.assertFalse(ad.validate())
self.assertEqual(ad.number_of_paths_algorithm(0, 0, 16),
algorithm.acyclic)
self.assertEqual(ad.number_of_paths(0, 0, 30), 9)
self.assertEqual(ad.number_of_paths(1, 0, 10, algorithm.matrix), 6)
self.assertEqual(ad.number_of_paths(1, 9, 0, 10, algorithm.matrix), 3)
def test_009(self):
for k in range(2, 50):
graph = ActionDigraph(k, k)
for i in range(k):
for j in range(k):
graph.add_edge(i, j, j)
self.assertEqual(graph.number_of_scc(), 1)
forest = graph.spanning_forest()
self.assertEqual(forest.parent(k - 1), UNDEFINED)
graph.reverse_spanning_forest()
def test_020(self):
"cbegin/end_panislo - 100 node path"
ad = ActionDigraph()
n = 100
ad.add_nodes(n)
ad.add_to_out_degree(2)
for i in range(n - 1):
ad.add_edge(i, i + 1, i % 2)
self.assertEqual(
len(list(ad.panilo_iterator(0, 0, POSITIVE_INFINITY))), 100)
self.assertEqual(
sum(1 for _ in ad.panilo_iterator(50, 0, POSITIVE_INFINITY)), 50)
pths = list(ad.panislo_iterator(0, 0, POSITIVE_INFINITY))
self.assertEqual(len(pths), 100)
self.assertEqual(pths[3][0], [0, 1, 0])
self.assertEqual(
sum(1 for _ in ad.panislo_iterator(50, 0, POSITIVE_INFINITY)), 50)
def test_003(self):
g = ActionDigraph(17, 31)
for i in range(17):
with self.assertRaises(RuntimeError):
g.number_of_scc()
for j in range(31):
g.add_edge(i, (7 * i + 23 * j) % 17, j)
self.assertEqual(g.number_of_edges(), 31 * 17)
self.assertEqual(g.number_of_nodes(), 17)
with self.assertRaises(RuntimeError):
g.add_edge(0, 0, 32)
for i in range(17):
for j in range(31):
self.assertEqual(g.neighbor(i, j), (7 * i + 23 * j) % 17)
g.add_to_out_degree(10)
self.assertEqual(g.out_degree(), 41)
self.assertEqual(g.number_of_nodes(), 17)
self.assertFalse(g.validate())
for i in range(17):
for j in range(10):
g.add_edge(i, (7 * i + 23 * j) % 17, 31 + j)
self.assertEqual(g.number_of_edges(), 41 * 17)
self.assertEqual(g.number_of_nodes(), 17)
def test_008(self):
graph = ActionDigraph(10, 5)
with self.assertRaises(RuntimeError):
graph.neighbor(10, 0)
self.assertEqual(graph.neighbor(0, 1), UNDEFINED)
with self.assertRaises(RuntimeError):
graph.add_edge(0, 10, 0)
with self.assertRaises(RuntimeError):
graph.add_edge(10, 0, 0)
for i in range(5):
graph.add_edge(0, 1, i)
graph.add_edge(2, 2, i)
graph.add_edge(0, 1, 0)
graph.add_edge(2, 2, 0)
with self.assertRaises(RuntimeError):
graph.scc_id(10)
def binary_tree(number_of_levels):
ad = ActionDigraph()
ad.add_nodes(2**number_of_levels - 1)
ad.add_to_out_degree(2)
ad.add_edge(0, 1, 0)
ad.add_edge(0, 2, 1)
for i in range(2, number_of_levels + 1):
counter = 2**(i - 1) - 1
for j in range(2**(i - 2) - 1, 2**(i - 1) - 1):
ad.add_edge(j, counter, 0)
counter += 1
ad.add_edge(j, counter, 1)
counter += 1
return ad
def test_010(self):
j = 33
graph = ActionDigraph()
graph.add_to_out_degree(1)
for k in range(10):
graph.add_nodes(j)
for i in range(k * j, (k + 1) * j - 1):
graph.add_edge(i, i + 1, 0)
graph.add_edge((k + 1) * j - 1, k * j, 0)
for i in range(10 * j):
self.assertEqual(graph.scc_id(i), i // j)
forest = graph.spanning_forest()
self.assertEqual(
list(forest.parent_iterator()),
[
32,
0,
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,
UNDEFINED,
65,
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,
UNDEFINED,
98,
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,
UNDEFINED,
131,
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,
UNDEFINED,
164,
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,
UNDEFINED,
197,
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,
UNDEFINED,
230,
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,
UNDEFINED,
263,
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,
UNDEFINED,
296,
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,
UNDEFINED,
329,
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,
UNDEFINED,
],
)
def test_037(self): # pylint: disable=too-many-statements
algorithm = ActionDigraph.algorithm
n = 10
ad = ActionDigraph()
ad.add_nodes(10)
ad.add_to_out_degree(20)
ad.add_edge(0, 9, 0)
ad.add_edge(0, 1, 1)
ad.add_edge(0, 6, 2)
ad.add_edge(0, 3, 3)
ad.add_edge(0, 7, 4)
ad.add_edge(0, 2, 5)
ad.add_edge(0, 2, 6)
ad.add_edge(0, 8, 7)
ad.add_edge(0, 1, 8)
ad.add_edge(0, 4, 9)
ad.add_edge(0, 3, 10)
ad.add_edge(0, 1, 11)
ad.add_edge(0, 7, 12)
ad.add_edge(0, 9, 13)
ad.add_edge(0, 4, 14)
ad.add_edge(0, 7, 15)
ad.add_edge(0, 8, 16)
ad.add_edge(0, 9, 17)
ad.add_edge(0, 6, 18)
ad.add_edge(0, 9, 19)
ad.add_edge(1, 8, 0)
ad.add_edge(1, 2, 1)
ad.add_edge(1, 5, 2)
ad.add_edge(1, 7, 3)
ad.add_edge(1, 9, 4)
ad.add_edge(1, 0, 5)
ad.add_edge(1, 2, 6)
ad.add_edge(1, 4, 7)
ad.add_edge(1, 0, 8)
ad.add_edge(1, 3, 9)
ad.add_edge(1, 2, 10)
ad.add_edge(1, 7, 11)
ad.add_edge(1, 2, 12)
ad.add_edge(1, 7, 13)
ad.add_edge(1, 6, 14)
ad.add_edge(1, 6, 15)
ad.add_edge(1, 5, 16)
ad.add_edge(1, 4, 17)
ad.add_edge(1, 6, 18)
ad.add_edge(1, 3, 19)
ad.add_edge(2, 2, 0)
ad.add_edge(2, 9, 1)
ad.add_edge(2, 0, 2)
ad.add_edge(2, 6, 3)
ad.add_edge(2, 7, 4)
ad.add_edge(2, 9, 5)
ad.add_edge(2, 5, 6)
ad.add_edge(2, 4, 7)
ad.add_edge(2, 9, 8)
ad.add_edge(2, 7, 9)
ad.add_edge(2, 9, 10)
ad.add_edge(2, 9, 11)
ad.add_edge(2, 0, 12)
ad.add_edge(2, 7, 13)
ad.add_edge(2, 9, 14)
ad.add_edge(2, 6, 15)
ad.add_edge(2, 3, 16)
ad.add_edge(2, 3, 17)
ad.add_edge(2, 4, 18)
ad.add_edge(2, 1, 19)
ad.add_edge(3, 1, 0)
ad.add_edge(3, 9, 1)
ad.add_edge(3, 6, 2)
ad.add_edge(3, 2, 3)
ad.add_edge(3, 9, 4)
ad.add_edge(3, 8, 5)
ad.add_edge(3, 1, 6)
ad.add_edge(3, 6, 7)
ad.add_edge(3, 1, 8)
ad.add_edge(3, 0, 9)
ad.add_edge(3, 5, 10)
ad.add_edge(3, 0, 11)
ad.add_edge(3, 2, 12)
ad.add_edge(3, 7, 13)
ad.add_edge(3, 4, 14)
ad.add_edge(3, 0, 15)
ad.add_edge(3, 4, 16)
ad.add_edge(3, 8, 17)
ad.add_edge(3, 3, 18)
ad.add_edge(3, 1, 19)
ad.add_edge(4, 0, 0)
ad.add_edge(4, 4, 1)
ad.add_edge(4, 8, 2)
ad.add_edge(4, 5, 3)
ad.add_edge(4, 5, 4)
ad.add_edge(4, 1, 5)
ad.add_edge(4, 3, 6)
ad.add_edge(4, 8, 7)
ad.add_edge(4, 4, 8)
ad.add_edge(4, 4, 9)
ad.add_edge(4, 4, 10)
ad.add_edge(4, 7, 11)
ad.add_edge(4, 8, 12)
ad.add_edge(4, 6, 13)
ad.add_edge(4, 3, 14)
ad.add_edge(4, 7, 15)
ad.add_edge(4, 6, 16)
ad.add_edge(4, 7, 17)
ad.add_edge(4, 0, 18)
ad.add_edge(4, 2, 19)
ad.add_edge(5, 3, 0)
ad.add_edge(5, 0, 1)
ad.add_edge(5, 4, 2)
ad.add_edge(5, 7, 3)
ad.add_edge(5, 2, 4)
ad.add_edge(5, 5, 5)
ad.add_edge(5, 7, 6)
ad.add_edge(5, 7, 7)
ad.add_edge(5, 7, 8)
ad.add_edge(5, 7, 9)
ad.add_edge(5, 0, 10)
ad.add_edge(5, 8, 11)
ad.add_edge(5, 6, 12)
ad.add_edge(5, 8, 13)
ad.add_edge(5, 8, 14)
ad.add_edge(5, 1, 15)
ad.add_edge(5, 5, 16)
ad.add_edge(5, 5, 17)
ad.add_edge(5, 3, 18)
ad.add_edge(5, 7, 19)
ad.add_edge(6, 8, 0)
ad.add_edge(6, 7, 1)
ad.add_edge(6, 6, 2)
ad.add_edge(6, 5, 3)
ad.add_edge(6, 6, 4)
ad.add_edge(6, 1, 5)
ad.add_edge(6, 7, 6)
ad.add_edge(6, 2, 7)
ad.add_edge(6, 7, 8)
ad.add_edge(6, 3, 9)
ad.add_edge(6, 3, 10)
ad.add_edge(6, 8, 11)
ad.add_edge(6, 3, 12)
ad.add_edge(6, 9, 13)
ad.add_edge(6, 4, 14)
ad.add_edge(6, 1, 15)
ad.add_edge(6, 4, 16)
ad.add_edge(6, 3, 17)
ad.add_edge(6, 9, 18)
ad.add_edge(6, 8, 19)
ad.add_edge(7, 9, 0)
ad.add_edge(7, 4, 1)
ad.add_edge(7, 3, 2)
ad.add_edge(7, 8, 3)
ad.add_edge(7, 0, 4)
ad.add_edge(7, 5, 5)
ad.add_edge(7, 6, 6)
ad.add_edge(7, 8, 7)
ad.add_edge(7, 9, 8)
ad.add_edge(7, 1, 9)
ad.add_edge(7, 7, 10)
ad.add_edge(7, 0, 11)
ad.add_edge(7, 6, 12)
ad.add_edge(7, 2, 13)
ad.add_edge(7, 3, 14)
ad.add_edge(7, 8, 15)
ad.add_edge(7, 6, 16)
ad.add_edge(7, 3, 17)
ad.add_edge(7, 2, 18)
ad.add_edge(7, 7, 19)
ad.add_edge(8, 0, 0)
ad.add_edge(8, 6, 1)
ad.add_edge(8, 3, 2)
ad.add_edge(8, 5, 3)
ad.add_edge(8, 7, 4)
ad.add_edge(8, 9, 5)
ad.add_edge(8, 9, 6)
ad.add_edge(8, 8, 7)
ad.add_edge(8, 1, 8)
ad.add_edge(8, 5, 9)
ad.add_edge(8, 7, 10)
ad.add_edge(8, 9, 11)
ad.add_edge(8, 6, 12)
ad.add_edge(8, 0, 13)
ad.add_edge(8, 0, 14)
ad.add_edge(8, 3, 15)
ad.add_edge(8, 6, 16)
ad.add_edge(8, 0, 17)
ad.add_edge(8, 8, 18)
ad.add_edge(8, 9, 19)
ad.add_edge(9, 3, 0)
ad.add_edge(9, 7, 1)
ad.add_edge(9, 9, 2)
ad.add_edge(9, 1, 3)
ad.add_edge(9, 4, 4)
ad.add_edge(9, 9, 5)
ad.add_edge(9, 4, 6)
ad.add_edge(9, 0, 7)
ad.add_edge(9, 5, 8)
ad.add_edge(9, 8, 9)
ad.add_edge(9, 3, 10)
ad.add_edge(9, 2, 11)
ad.add_edge(9, 0, 12)
ad.add_edge(9, 2, 13)
ad.add_edge(9, 3, 14)
ad.add_edge(9, 4, 15)
ad.add_edge(9, 0, 16)
ad.add_edge(9, 5, 17)
ad.add_edge(9, 3, 18)
ad.add_edge(9, 5, 19)
self.assertFalse(is_acyclic(ad))
self.assertTrue(ad.validate())
self.assertEqual(ad.number_of_paths_algorithm(0), algorithm.acyclic)
self.assertEqual(ad.number_of_paths(0), POSITIVE_INFINITY)
with self.assertRaises(RuntimeError):
ad.number_of_paths(0, 0, 10, algorithm.acyclic)
with self.assertRaises(RuntimeError):
ad.number_of_paths(1, 9, 0, 10, algorithm.acyclic)
ad = binary_tree(n)
self.assertEqual(ad.number_of_paths_algorithm(0), algorithm.acyclic)
self.assertEqual(ad.number_of_paths(0), 1023)
add_cycle(ad, n)
ad.add_edge(0, n + 1, 0)
self.assertFalse(is_acyclic(ad))
self.assertFalse(ad.validate())
self.assertEqual(ad.number_of_paths(1), 511)
self.assertEqual(
ad.number_of_paths_algorithm(1, 0, POSITIVE_INFINITY),
algorithm.acyclic,
)
self.assertEqual(ad.number_of_paths(1, 0, POSITIVE_INFINITY), 511)
self.assertEqual(len(topological_sort(ad)), 0)
for m in ad.nodes_iterator():
if len(topological_sort(ad, m)) == 0:
self.assertEqual(m, 1023)
break
def test_024(self):
ad = ActionDigraph()
ad.add_nodes(6)
ad.add_to_out_degree(2)
ad.add_edge(0, 1, 0)
ad.add_edge(0, 2, 1)
ad.add_edge(1, 3, 0)
ad.add_edge(1, 4, 1)
ad.add_edge(2, 4, 0)
ad.add_edge(2, 2, 1)
ad.add_edge(3, 1, 0)
ad.add_edge(3, 5, 1)
ad.add_edge(4, 5, 0)
ad.add_edge(4, 4, 1)
ad.add_edge(5, 4, 0)
ad.add_edge(5, 5, 1)
N = 18
self.assertEqual(ad.number_of_paths(0, 4, 0, N), 131062)
self.assertEqual(ad.number_of_paths(0, 4, 10, N), 130556)
self.assertEqual(ad.number_of_paths(4, 1, 0, N), 0)
self.assertEqual(ad.number_of_paths(0, 0, POSITIVE_INFINITY),
POSITIVE_INFINITY)
self.assertEqual(ad.number_of_paths(0, 0, 10), 1023)