-
Notifications
You must be signed in to change notification settings - Fork 0
/
regula_generacji.c
59 lines (53 loc) · 1.86 KB
/
regula_generacji.c
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
#include "regula_generacji.h"
int** create_next_gen_Moore_a(int * * matrix) {
int * * matrix_new = malloc(sizeof(int * ) * height);
int i, j;
int neighbours_alive;
for (i = 0; i < height; i++) {
matrix_new[i] = malloc(sizeof(int) * width);
}
for (i = 0; i < height; i++) {
for (j = 0; j < width; j++) {
neighbours_alive = count_neighbours_Moore_a(j, i, matrix);
if (matrix[i][j] == 0 && neighbours_alive == 3) {
matrix_new[i][j] = 1;
} else if (matrix[i][j] == 1 && (neighbours_alive == 2 || neighbours_alive == 3)) {
matrix_new[i][j] = 1;
} else if (matrix[i][j] == 1 && neighbours_alive != 2 && neighbours_alive != 3) {
matrix_new[i][j] = 0;
} else {
matrix_new[i][j] = matrix[i][j];
}
}
}
return matrix_new;
}
int** create_next_gen_Neumann(int * * matrix) {
int * * matrix_new = malloc(sizeof(int * ) * height);
int i, j;
int neighbours_alive;
for (i = 0; i < height; i++) {
matrix_new[i] = malloc(sizeof(int) * width);
}
for (i = 0; i < height; i++) {
for (j = 0; j < width; j++) {
neighbours_alive = count_neighbours_Neumann(j, i, matrix);
if (matrix[i][j] == 0 && neighbours_alive == 3) {
matrix_new[i][j] = 1;
} else if (matrix[i][j] == 1 && (neighbours_alive == 2 || neighbours_alive == 3)) {
matrix_new[i][j] = 1;
} else if (matrix[i][j] == 1 && neighbours_alive != 2 && neighbours_alive != 3) {
matrix_new[i][j] = 0;
} else {
matrix_new[i][j] = matrix[i][j];
}
}
}
return matrix_new;
}
void free_matrix(int * * matrix) {
int i;
for (i = 0; i < width; i++)
free(matrix[i]);
free(matrix);
}