30 explicit colored_grid(
unsigned int width = 1u,
unsigned int length = 1u,
unsigned int levels = 1u);
35 virtual std::optional<std::string>
contents_of(
const std::shared_ptr<cell>& c)
const noexcept override;
40 virtual std::optional<std::uint32_t>
background_color_for(
const std::shared_ptr<cell>& c)
const noexcept override;
Binary tree algorithm for generating mazes.
Definition binary_tree.h:18
Extension of the grid class to include color information.
Definition colored_grid.h:18
virtual std::optional< std::uint32_t > background_color_for(const std::shared_ptr< cell > &c) const noexcept override
Retrieves the background color for a given cell, if available.
virtual std::optional< std::string > contents_of(const std::shared_ptr< cell > &c) const noexcept override
Retrieves the contents of a given cell, if available.
colored_grid(unsigned int width=1u, unsigned int length=1u, unsigned int levels=1u)
Constructs a colored grid with specified dimensions.
Depth-first search algorithm for generating mazes.
Definition dfs.h:19
A grid that can calculate distances between cells.
Definition distance_grid.h:19
Sidewinder algorithm for generating mazes.
Definition sidewinder.h:17
Namespace for the maze builder.
Definition algo_interface.h:9