AStar

Class Overview

Implementation of the A* algorithm. The A* algorithm extends the original Dijkstra's algorithm by including heuristics to improve the search. By default, the implementation uses a java.util.PriorityQueue for the nodes, which requires O(log n) time for insertions. The queue can be changed to use another type of queue, for example a fibonacci heap as a queue, which works with constant amortized time for insertions.

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()