-
maze
Maze maze
The maze being searched.
-
forkAfter
int forkAfter
Number of steps (nodes to be visited) before forking. This is
set to 0
in SequentialSolver
, which
means no forking.
-
visited
java.util.Set<E> visited
Set of identifiers of all nodes visited so far during the
search.
-
predecessor
java.util.Map<K,V> predecessor
If (m -> n)
is in precedessor
, then
the node with identifier n
has been first visited
from its neighbor node with identifier m
during
the search.
-
frontier
java.util.Stack<E> frontier
The nodes in the maze to be visited next. Using a stack
implements a search that goes depth first..
-
start
int start
The identifier of the node in the maze from where the search
starts.