Skip navigation links
A C F H I M N P S V 

A

Amazed - Class in amazed.maze
Amazed is a simple application class that applies a solver to a maze.
Amazed(String, boolean, int, int) - Constructor for class amazed.maze.Amazed
Creates a maze reading from map file map.
amazed.maze - package amazed.maze
 
amazed.solver - package amazed.solver
 

C

compute() - Method in class amazed.solver.ForkJoinSolver
Searches for and returns the path, as a list of node identifiers, that goes from the start node to a goal node in the maze.
compute() - Method in class amazed.solver.SequentialSolver
Searches for and returns the path, as a list of node identifiers, that goes from the start node to a goal node in the maze.

F

forkAfter - Variable in class amazed.solver.SequentialSolver
Number of steps (nodes to be visited) before forking.
ForkJoinSolver - Class in amazed.solver
ForkJoinSolver implements a solver for Maze objects using a fork/join multi-thread depth-first search.
ForkJoinSolver(Maze) - Constructor for class amazed.solver.ForkJoinSolver
Creates a solver that searches in maze from the start node to a goal.
ForkJoinSolver(Maze, int) - Constructor for class amazed.solver.ForkJoinSolver
Creates a solver that searches in maze from the start node to a goal, forking after a given number of visited nodes.
frontier - Variable in class amazed.solver.SequentialSolver
The nodes in the maze to be visited next.

H

hasGoal(int) - Method in class amazed.maze.Maze
Tests whether a given node contains a goal.

I

initStructures() - Method in class amazed.solver.SequentialSolver
Initializes visited, predecessor, and frontier with empty data structures for sequential access.

M

Maze - Class in amazed.maze
Maze is the main public class through which methods clients can explore a maze.
maze - Variable in class amazed.solver.SequentialSolver
The maze being searched.
move(int, int) - Method in class amazed.maze.Maze
Moves an existing animated player to a given node.

N

neighbors(int) - Method in class amazed.maze.Maze
Returns the set of the identifiers of all nodes directly adjacent to a given node, and accessible from it.
newPlayer(int) - Method in class amazed.maze.Maze
Creates a new animated player, and place it on a given node.

P

pathFromTo(int, int) - Method in class amazed.solver.SequentialSolver
Returns the connected path, as a list of node identifiers, that goes from node from to node to following the inverse of relation predecessor.
predecessor - Variable in class amazed.solver.SequentialSolver
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.

S

SequentialSolver - Class in amazed.solver
SequentialSolver implements a solver for Maze objects using a single-thread depth-first search.
SequentialSolver(Maze) - Constructor for class amazed.solver.SequentialSolver
Creates a solver that searches in maze from the start node to a goal.
showSolution() - Method in class amazed.maze.Amazed
Displays the solution by removing all players and marking a path from the start node to a goal on the maze graphical representation.
solve() - Method in class amazed.maze.Amazed
Runs the solver on the maze, waits for termination, and prints to screen the outcome of the search.
start() - Method in class amazed.maze.Maze
Returns the unique identifier of the start node, corresponding to the top-left cell in the maze.
start - Variable in class amazed.solver.SequentialSolver
The identifier of the node in the maze from where the search starts.

V

visited - Variable in class amazed.solver.SequentialSolver
Set of identifiers of all nodes visited so far during the search.
A C F H I M N P S V 
Skip navigation links