java.lang.Object | |
↳ | es.usc.citius.hipster.algorithm.ADStarForward.Iterator |
Internal iterator that implements all the logic of the A* search
Fields | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
protected final N extends ADStarNode<A, S, C extends Comparable<C>, N> | beginNode | ||||||||||
protected Map<S, N extends ADStarNode<A, S, C extends Comparable<C>, N>> | closed | ||||||||||
protected final Collection<N extends ADStarNode<A, S, C extends Comparable<C>, N>> | goalNodes | ||||||||||
protected Map<S, N extends ADStarNode<A, S, C extends Comparable<C>, N>> | incons | ||||||||||
protected Map<S, N extends ADStarNode<A, S, C extends Comparable<C>, N>> | open | ||||||||||
protected Queue<N extends ADStarNode<A, S, C extends Comparable<C>, N>> | queue | ||||||||||
protected Iterable<Transition<A, S>> | transitionsChanged |
Protected Constructors | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
ADStarForward.Iterator() |
Public Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Map<S, N> |
getClosed()
Get the internal map used by the algorithm to keep the relations between
explored states and nodes.
| ||||||||||
Map<S, N> | getIncons() | ||||||||||
Map<S, N> |
getOpen()
AD* uses the OPEN queue to order the most promising nodes to be expanded by the
algorithm.
| ||||||||||
boolean |
hasNext()
As the algorithm is executed iteratively refreshing the changed relations
between nodes, this method will return always true.
| ||||||||||
N | next() | ||||||||||
void |
remove()
Removing is not supported.
|
Protected Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
void |
insertOpen(N node)
Inserts a node in the open queue.
| ||||||||||
N |
takePromising()
Retrieves the most promising node from the open collection, or null if it
is empty.
| ||||||||||
void |
updateQueues(N node)
Updates the membership of the node to the algorithm queues.
|
[Expand]
Inherited Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
![]() | |||||||||||
![]() |
Get the internal map used by the algorithm to keep the relations between explored states and nodes. Modifications to the map can alter the normal function of the algorithm.
AD* uses the OPEN queue to order the most promising nodes to be expanded by the
algorithm. This method retrieves the original map (not a copy) that contains
the pairs of
As the algorithm is executed iteratively refreshing the changed relations between nodes, this method will return always true.
Removing is not supported.
Inserts a node in the open queue.
node | instance of node to add |
---|
Retrieves the most promising node from the open collection, or null if it is empty.
Updates the membership of the node to the algorithm queues.
node | instance of node |
---|