Jank thoughts on using the dijk map to walk from door to door for tunnels.
This commit is contained in:
parent
b100950877
commit
a82944f55a
3 changed files with 49 additions and 33 deletions
4
map.hpp
4
map.hpp
|
@ -16,6 +16,8 @@ struct Room {
|
|||
size_t y = 0;
|
||||
size_t width = 0;
|
||||
size_t height = 0;
|
||||
size_t door_x = 0;
|
||||
size_t door_y = 0;
|
||||
|
||||
std::vector<Room> next;
|
||||
};
|
||||
|
@ -57,7 +59,7 @@ public:
|
|||
void make_room(size_t origin_y, size_t origin_x, size_t width, size_t height);
|
||||
|
||||
void generate();
|
||||
void draw_map(Room &root);
|
||||
void place_rooms(Room &root);
|
||||
void make_paths();
|
||||
void partition_map(Room &cur, int depth);
|
||||
void dump();
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue