Expand description
Modules
Implementations
Structs
Data structure representing a maze on a grid.
stores each possible paths as a HashMap
mapping each positions to the accessible adjascent ones.
A discrete position on a 2D-grid.
Traits
Functions
Most common maze generation technique, recursively creating paths to unvisited cells, each time choosing next direction at random.