25 bool run(std::unique_ptr<grid_interface>
const& g,
const std::function<
int(
int,
int)>& get_int,
const std::mt19937& rng)
const noexcept override;
32 bool run_on_cell(std::shared_ptr<cell>
const& c,
const std::function<
int(
int,
int)>& get_int,
const std::mt19937& rng)
const noexcept;
Interface for the maze generation algorithms.
Definition algo_interface.h:18
Binary tree algorithm for generating mazes.
Definition binary_tree.h:18
bool run(std::unique_ptr< grid_interface > const &g, const std::function< int(int, int)> &get_int, const std::mt19937 &rng) const noexcept override
Run the binary tree algorithm.
Namespace for the maze builder.
Definition algo_interface.h:9