diff options
Diffstat (limited to 'map.h')
| -rw-r--r-- | map.h | 9 |
1 files changed, 6 insertions, 3 deletions
@@ -4,7 +4,7 @@ #include <stddef.h> #include "structs.h" #include "path.h" - +#include "priority_queue.h" /* Returns an empty map of given size */ Map empty_map(size_t width, size_t height); @@ -12,6 +12,9 @@ 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, \ 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, \ + char visited[height][width]); /* https://en.wikipedia.org/wiki/Maze_generation_algorithm#Randomized_depth-first_search * WARNING: width and height are not the width and height of the returned map! @@ -35,8 +38,8 @@ Map rbt_maze_map(size_t width, size_t height, unsigned int seed); Map file_plaintext_map(char *filename, size_t *width, size_t *height, Position *start_pos, Position *end_pos); /* Draw the map. Bet you didn't expect that. - * path could be NULL to draw a map with no path */ -void draw_map(Map map, size_t width, size_t height, int offset_x, int offset_y, Position start, Position goal, Path path, char visited[height][width]); + * path could be NULL to draw a map with no path. So can cursor, frontier and visited */ +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); void print_map_out(Map map, size_t width, size_t height); |