mazes::dfs Class Reference

Depth-first search algorithm for generating mazes. More...

#include <dfs.h>

Inheritance diagram for mazes::dfs:

Collaboration diagram for mazes::dfs:

Public Member Functions
virtual bool	run (const std::unique_ptr< grid_interface > &g, const std::function< int(int, int)> &get_int, const std::mt19937 &rng) const noexcept override
	Run the depth-first search algorithm.
Public Member Functions inherited from mazes::algo_interface

Detailed Description

Depth-first search algorithm for generating mazes.

Also-known-as the recursive backtracker algorithm

This algorithm is used to generate mazes by visiting each cell in the grid and carving a path to the next cell

Member Function Documentation

run()

virtual bool mazes::dfs::run ( const std::unique_ptr< grid_interface > & g, const std::function< int(int, int)> & get_int, const std::mt19937 & rng ) const

overridevirtualnoexcept

Run the depth-first search algorithm.

Parameters

g
get_int
rng

Returns

success or failure

Implements mazes::algo_interface.

---

The documentation for this class was generated from the following file:

• dfs.h