Percolation/Site percolation: Difference between revisions

 

=={{header|C}}==

{{trans|D}}

<lang c>#include <stdio.h>

#include <string.h>

#include <stdbool.h>

#define N_COLS 15

#define N_ROWS 15

// Simulation tries

typedef unsigned char Cell;

enum { EMPTY_CELL = ' ',

VISITED_CELL = '.' };

typedef Cell Grid[N_ROWS][N_COLS];

void initialize(Grid grid, const double probability) {

for (size_t r = 0; r < N_ROWS; r++)

}

}

void show(Grid grid) {

char line[N_COLS + 3];

line[N_COLS + 1] = '+';

line[N_COLS + 2] = '\0';

printf("%s\n", line);

for (size_t r = 0; r < N_ROWS; r++) {

printf("%s\n", line);

}

bool walk(Grid grid, const size_t r, const size_t c) {

const size_t bottom = N_ROWS - 1;

grid[r][c] = VISITED_CELL;

if (r < bottom && grid[r + 1][c] == EMPTY_CELL) { // Down.

if (walk(grid, r + 1, c))

} else if (r == bottom)

return true;

if (c && grid[r][c - 1] == EMPTY_CELL) // Left.

if (walk(grid, r, c - 1))

return true;

if (c < N_COLS - 1 && grid[r][c + 1] == EMPTY_CELL) // Right.

if (walk(grid, r, c + 1))

return true;

if (r && grid[r - 1][c] == EMPTY_CELL) // Up.

if (walk(grid, r - 1, c))

return true;

return false;

}

bool percolate(Grid grid) {

const size_t startR = 0;

return false;

}

typedef struct {

double prob;

size_t count;

} Counter;

int main() {

Counter counters[N_STEPS];

for (size_t i = 0; i < N_STEPS; i++)

counters[i] = (Counter){ i * probability_step, 0 };

bool sample_shown = false;

static Grid grid;

srand(time(NULL));

for (size_t i = 0; i < N_STEPS; i++) {

for (size_t t = 0; t < N_TRIES; t++) {

}

}

printf("\nFraction of %d tries that percolate through:\n", N_TRIES);

for (size_t i = 0; i < N_STEPS; i++)

counters[i].count / (double)N_TRIES);

return 0;

{{out}}

+---------------+

+---------------+

 

 

=={{header|D}}==