Expand description

Implementations

This module contains concrete types implementing the crate::Algorithm trait. They drive the resolution of a crate::Maze through different means.

Structs

Algorithm traversing the crate::Maze as a common graph. Storing each possible paths form shortest to longest and extending the shortest ones first. Most effective when the resolution is among the shortest possible paths.

Algorithm driving the resolution of a crate::Maze traversing it as a common graph in a depth-first fashion. Stores the current path and possible branches in a stack.