From 492ed6b629d5f1e22fd53f2f44b911d0a45d01f7 Mon Sep 17 00:00:00 2001 From: Kirill Petrashin Date: Thu, 26 Mar 2026 12:54:15 +0300 Subject: Add cost_array into neighbours_8dir() --- map.h | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) (limited to 'map.h') diff --git a/map.h b/map.h index d940357..ef76a7c 100644 --- a/map.h +++ b/map.h @@ -10,10 +10,12 @@ Map empty_map(size_t width, size_t height); /* Stores all the existing 4dir neighbours of pos in neighbour_array and returns their amount */ -unsigned int neighbours_4dir(Position neighbour_array[], Position pos, size_t width, size_t height, \ +unsigned int neighbours_4dir(Position neighbour_array[4], Position pos, size_t width, size_t height, \ char visited[height][width]); -/* Stores all the existing 8dir neighbours of pos in neighbour_array and returns their amount */ -unsigned int neighbours_8dir(Position neighbour_array[], Position pos, size_t width, size_t height, \ +/* Stores all the existing 8dir neighbours of pos in neighbour_array and returns their amount. + * Additionaly stores costs into cost_array if it's not NULL. + * The cost of goint orthogonally is 10, diagonaly is 14 (sqrt(2) * 10) */ +unsigned int neighbours_8dir(Position neighbour_array[8], size_t cost_array[8], Position pos, size_t width, size_t height, \ char visited[height][width]); /* https://en.wikipedia.org/wiki/Maze_generation_algorithm#Randomized_depth-first_search -- cgit v1.2.3