-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathneumann_grid.py
100 lines (89 loc) · 3.07 KB
/
neumann_grid.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
from abc import ABC
from grid import Grid
class NeumannGrid(Grid, ABC):
def neighbours(self, n):
if n == 0: # top left
nb = [self.__n3(n),
self.__n4(n)]
elif n == self.size - 1: # top right
nb = [self.__n2(n),
self.__n4(n)]
elif n == self.size * (self.size - 1): # bottom left
nb = [self.__n1(n),
self.__n3(n)]
elif n == self.size ** 2 - 1: # bottom right
nb = [self.__n1(n),
self.__n2(n)]
elif n < self.size: # top
nb = [self.__n2(n),
self.__n3(n),
self.__n4(n)]
elif n % self.size == 0: # left
nb = [self.__n1(n),
self.__n3(n),
self.__n4(n)]
elif n % self.size == self.size - 1: # right
nb = [self.__n1(n),
self.__n2(n),
self.__n4(n)]
elif n >= self.size * (self.size - 1): # bottom
nb = [self.__n1(n),
self.__n2(n),
self.__n3(n)]
else:
nb = [self.__n1(n),
self.__n2(n),
self.__n3(n),
self.__n4(n)]
return nb
def neighbours_indices(self, n):
if n == 0: # top left
nb = [self.__n3_index(n),
self.__n4_index(n)]
elif n == self.size - 1: # top right
nb = [self.__n2_index(n),
self.__n4_index(n)]
elif n == self.size * (self.size - 1): # bottom left
nb = [self.__n1_index(n),
self.__n3_index(n)]
elif n == self.size ** 2 - 1: # bottom right
nb = [self.__n1_index(n),
self.__n2_index(n)]
elif n < self.size: # top
nb = [self.__n2_index(n),
self.__n3_index(n),
self.__n4_index(n)]
elif n % self.size == 0: # left
nb = [self.__n1_index(n),
self.__n3_index(n),
self.__n4_index(n)]
elif n % self.size == self.size - 1: # right
nb = [self.__n1_index(n),
self.__n2_index(n),
self.__n4_index(n)]
elif n >= self.size * (self.size - 1): # bottom
nb = [self.__n1_index(n),
self.__n2_index(n),
self.__n3_index(n)]
else:
nb = [self.__n1_index(n),
self.__n2_index(n),
self.__n3_index(n),
self.__n4_index(n)]
return nb
def __n1(self, n):
return self.cells[self.__n1_index(n)]
def __n2(self, n):
return self.cells[self.__n2_index(n)]
def __n3(self, n):
return self.cells[self.__n3_index(n)]
def __n4(self, n):
return self.cells[self.__n4_index(n)]
def __n1_index(self, n):
return n - self.size
def __n2_index(self, n):
return n - 1
def __n3_index(self, n):
return n + 1
def __n4_index(self, n):
return n + self.size