Struct minotaur::Grid

pub struct Grid { /* fields omitted */ }

Methods

impl Grid

pub fn new(width: usize, height: usize) -> Grid

pub fn binary_tree(&mut self, seed: Option<u64>)

binary_tree populates the maze according to the following algorithm: Arbitrarily visit every cell, choosing NORTH or EAST as follows:

If both NORTH and EAST are valid, choose one direction randomly If only NORTH is valid, choose it 100% of the time If only EAST is valid, choose it 100% of the time

After choosing a direction, link this cell with its neighbor in that direction

The only cell that will not have a valid direction to choose from is the northeastern corner.

pub fn sidewinder(&mut self, seed: Option<u64>)

sidewinder populates the maze according to the following algorithm: Start with a cell on the western column. This cell starts a local "run."

Choose NORTH or EAST as follows: If both NORTH and EAST are valid, choose one direction randomly If only NORTH is valid, choose it 100% of the time If only EAST is valid, choose it 100% of the time

After choosing a direction, if EAST was chosen, link this cell with its neighbor in that direction. The EASTERN neighbor is then added to the local run and a direction is chosen for it. But if NORTH was chosen, then select at random one of the cells from the local run and link it with its NORTHERN neighbor. The local run is reset. Continue from the EASTERN neighbor.

pub fn aldous_broder(&mut self, seed: Option<u64>)

aldous_broder populates a maze in an unbiased way. Basically, first, a cell is chosen at random and considered "visited." Travel in a random direction. If the next cell is "unvisited", then link the two cells. Continue until all cells have been visited.

pub fn wilsons(&mut self, seed: Option<u64>)

wilsons populates a maze in an unbiased way. First, some random cell is set to be "visited." Then, some other random cell is "started." From there, travel randomly until you hit a "visited" cell. Once you hit a "visited" cell, connect all the links from the "started" cell. Then start over, choosing a new "unvisited" cell.

The trick is that there is a "loop removal" step. So while looking for a "visited" cell, if you loop back to a cell you've travelling through this run, then remove the loop you just made.

pub fn hunt_and_kill(&mut self, seed: Option<u64>)

pub fn recursive_backtracker(&mut self, seed: Option<u64>)

pub fn to_image(
    &self,
    cell_size: usize,
    wall_size: usize,
    background_pixel: Rgb<u8>,
    wall_pixel: Rgb<u8>
) -> RgbImage

Trait Implementations

impl PartialEq<Grid> for Grid

fn eq(&self, other: &Grid) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Grid) -> bool

This method tests for !=.

impl Display for Grid

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Debug for Grid

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Serialize for Grid

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<'de> Deserialize<'de> for Grid

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.