diff options
| author | Kirill Petrashin <kirill8201@yandex.ru> | 2026-03-27 08:48:48 +0300 |
|---|---|---|
| committer | Kirill Petrashin <kirill8201@yandex.ru> | 2026-03-27 08:48:48 +0300 |
| commit | 7e31a84be58805e3751c5aba27772bbb1716a5f5 (patch) | |
| tree | d24954e0403340a68db005a2e4d194947298cf8a /map.c | |
| parent | c3530ad46236adbba18bf47a5cc3841b0578ff70 (diff) | |
| download | astar-7e31a84be58805e3751c5aba27772bbb1716a5f5.tar.xz | |
Add cost_array to neighbours_4dir
Diffstat (limited to 'map.c')
| -rw-r--r-- | map.c | 10 |
1 files changed, 8 insertions, 2 deletions
@@ -24,27 +24,32 @@ Map empty_map(size_t width, size_t height) { } /* Honestly, what a shitty fucking way to implement this */ -unsigned int neighbours_4dir(Position neighbour_array[4], Position pos, size_t width, size_t height, \ +/* When we allow maps to have costs, these two neighbours functions will have to use the instead of COST_* defines */ +unsigned int neighbours_4dir(Position neighbour_array[4], size_t cost_array[4], Position pos, size_t width, size_t height, \ char visited[height][width]) { size_t cur = 0; if (pos.x > 0 && !visited[pos.y][pos.x - 1]) { neighbour_array[cur].x = pos.x - 1; neighbour_array[cur].y = pos.y; + if (cost_array != NULL) cost_array[cur] = COST_ORTHOGONAL; cur += 1; } if (pos.x + 1 < width && !visited[pos.y][pos.x + 1]) { neighbour_array[cur].x = pos.x + 1; neighbour_array[cur].y = pos.y; + if (cost_array != NULL) cost_array[cur] = COST_ORTHOGONAL; cur += 1; } if (pos.y > 0 && !visited[pos.y - 1][pos.x]) { neighbour_array[cur].x = pos.x; neighbour_array[cur].y = pos.y - 1; + if (cost_array != NULL) cost_array[cur] = COST_ORTHOGONAL; cur += 1; } if (pos.y + 1 < height && !visited[pos.y + 1][pos.x]) { neighbour_array[cur].x = pos.x; neighbour_array[cur].y = pos.y + 1; + if (cost_array != NULL) cost_array[cur] = COST_ORTHOGONAL; cur += 1; } @@ -139,7 +144,7 @@ Map rbt_maze_map(size_t width, size_t height, unsigned int seed) { srand(seed); do { - int nc = neighbours_4dir(na, ps_peek(ps), width, height, visited); + int nc = neighbours_4dir(na, NULL, ps_peek(ps), width, height, visited); if (nc > 0) { Position next = na[rand() % nc]; Position prev = ps_peek(ps); @@ -201,6 +206,7 @@ Map file_plaintext_map(char *filename, size_t *width, size_t *height, Position * } /* TODO: so many fucking arguments lmao. Break it down into several functions? */ +/* TODO: draw the start and goal with no background, allowing us to see the frontier/path/whatever's underneath. I think attr_get() will be useful */ void draw_map(Map map, size_t width, size_t height, int offset_x, int offset_y, Position start, Position goal, Position *cursor, Path path, char visited[height][width], PositionPQ *frontier) { /* I think it flickers less when we do that */ wnoutrefresh(stdscr); |
