-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdla.c
153 lines (133 loc) · 2.96 KB
/
dla.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
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
#include "dla.h"
int main(void)
{
direction d;
int row = 0, column = 0, hash_counter = 1;
char grid[SIZE][SIZE];
srand(time(NULL));
set_grid(grid);
rand_edge_particle(grid, &row, &column);
d = find_direction();
create_dla(grid, row, column, d, hash_counter);
return 0;
}
void set_grid(char grid[SIZE][SIZE])
{
int i, k;
for (i = 0; i < SIZE; i++){
for (k = 0; k < SIZE; k++){
grid[i][k] = ' ';
}
}
grid[SEED][SEED] = '#';
}
void rand_edge_particle(char grid[SIZE][SIZE], int *row, int *column)
{
do{
*row = rand() % SIZE;
*column = rand() % SIZE;
}while (edge_check(grid, row, column) == 0);
}
int edge_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (*row == TOP_ROW && grid[TOP_ROW][*column] != '#'){
return 1;
}
if (*row == BOTTOM_ROW && grid[BOTTOM_ROW][*column] != '#'){
return 1;
}
if (*column == FIRST_COLUMN && grid[*row][FIRST_COLUMN] != '#'){
return 1;
}
if (*column == LAST_COLUMN && grid[*row][LAST_COLUMN] != '#'){
return 1;
}
return 0;
}
int find_direction()
{
int d;
d = rand() % DIRECTIONS;
return d;
}
void create_dla(char grid[SIZE][SIZE], int row, int column, direction d, int hash_counter)
{
NCURS_Simplewin sw;
Neill_NCURS_Init(&sw);
Neill_NCURS_CharStyle(&sw, "#", COLOR_RED, COLOR_RED, A_NORMAL);
Neill_NCURS_CharStyle(&sw, " ", COLOR_BLACK, COLOR_BLACK, A_NORMAL);
do{
if (hash_check(grid, &row, &column) == 1){
hash_counter++;
grid[row][column] = '#';
Neill_NCURS_Delay(10.0);
Neill_NCURS_PrintArray(&grid[0][0], SIZE, SIZE, &sw);
rand_edge_particle(grid, &row, &column);
d = find_direction();
}
else {
move_particle(&row, &column, d);
d = find_direction();
}
Neill_NCURS_Events(&sw);
}while (hash_counter <= HASHES && !sw.finished);
}
int hash_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (top_hash_check(grid, row, column) || bottom_hash_check(grid, row, column)
|| left_hash_check(grid, row, column) || right_hash_check(grid, row, column)){
return 1;
}
return 0;
}
int top_hash_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (grid[negative_check(row)][*column] == '#'){
return 1;
}
return 0;
}
int bottom_hash_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (grid[(*row + 1) % SIZE][*column] == '#'){
return 1;
}
return 0;
}
int left_hash_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (grid[*row][negative_check(column)] == '#'){
return 1;
}
return 0;
}
int right_hash_check(char grid[SIZE][SIZE], int *row, int *column)
{
if (grid[*row][(*column + 1) % SIZE] == '#'){
return 1;
}
return 0;
}
/*TOP_ROW or FIRST_COLUMN, toroidal case, else normal case*/
int negative_check(int *number)
{
if (*number == 0){
return LAST_NUM;
}
return *number - 1;
}
void move_particle(int *row, int *column, direction d)
{
if (d == up){
*row = negative_check(row);
}
if (d == down){
*row = (*row + 1) % SIZE;
}
if (d == left){
*column = negative_check(column);
}
if (d == right){
*column = (*column + 1) % SIZE;
}
}