Known Direct Subclasses
IDAStar<A, S, C extends Comparable<C>, N extends HeuristicNode<A, S, C, N>> |
Implementation of the IDA* algorithm. |
|
Class Overview
Depth First Search (DFS) is a blind algorithm that performs an exploration
of the graph in a way that always reaches the deepest node before backtracking.
The Hipster implementation is a graph-based search that can handle cycles.
This algorithm is complete (it always finds a solution if it exists) but not
optimal.
For more information see
this article of the Wikipedia about DFS.
Summary
[Expand]
Inherited Methods |
From class
es.usc.citius.hipster.algorithm.Algorithm
static
<A, N extends Node<A, ?, N>>
List<A>
|
recoverActionPath(N node)
Returns a path of the actions applied from the initial state
to the state of the provided node ( state() ).
|
static
<S, N extends Node<?, S, N>>
List<S>
|
recoverStatePath(N node)
Returns a path with all the states of the path.
|
SearchResult
|
search(S goalState)
Run the algorithm until the goal is found or no more states are
available.
|
SearchResult
|
search(Predicate<N> condition)
Executes the search algorithm until the predicate condition is
satisfied or there are no more nodes to explore.
|
void
|
search(SearchListener<N> listener)
Executes the search algorithm and invokes the method
handle(Object) passing the current
explored node to the listener.
|
|
From class
java.lang.Object
Object
|
clone()
|
boolean
|
equals(Object arg0)
|
void
|
finalize()
|
final
Class<?>
|
getClass()
|
int
|
hashCode()
|
final
void
|
notify()
|
final
void
|
notifyAll()
|
String
|
toString()
|
final
void
|
wait()
|
final
void
|
wait(long arg0, int arg1)
|
final
void
|
wait(long arg0)
|
|
From interface
java.lang.Iterable
abstract
Iterator<T>
|
iterator()
|
|
Fields
protected
N extends Node<A, S, N>
initialNode
Public Constructors
public
DepthFirstSearch
(N initialNode, NodeExpander<A, S, N> expander)
Public Methods
public
Iterator<N>
iterator
()