struct Maze {
initial: State,
maze: [[Door; 30]; 30],
}
Expand description
initial
is the complete set of keys that we need to collect. Will always be binary
11111111111111111111111111
for the real input but fewer for sample data.
maze
is the adjacency of distances and doors between each pair of keys and the robots
starting locations.
Fields§
§initial: State
§maze: [[Door; 30]; 30]
Auto Trait Implementations§
impl Freeze for Maze
impl RefUnwindSafe for Maze
impl Send for Maze
impl Sync for Maze
impl Unpin for Maze
impl UnwindSafe for Maze
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more