java.lang.Object |
↳ |
es.usc.citius.hipster.algorithm.MultiobjectiveLS.Iterator |
Class Overview
MultiobjectiveLS iterator. It expands one state at a time and updates
an internal connected (nonDominated) which stores all non-dominated paths.
In order to find all non-dominated shortest path, the algorithm must be
executed until iterator.hasNext() == false
. Paths can be recovered
with iterator.getNonDominated.get(goalState)
Summary
Protected Methods |
Collection<N>
|
dominatedBy(N node, Iterable<N> nonDominated)
|
boolean
|
isDominated(N node, Iterable<N> nonDominated)
|
[Expand]
Inherited Methods |
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.util.Iterator
abstract
boolean
|
hasNext()
|
abstract
E
|
next()
|
abstract
void
|
remove()
|
|
Fields
public
Map<S, Collection<N extends HeuristicNode<A, S, C extends Comparable<C>, N>>>
nonDominated
protected
Queue<N extends HeuristicNode<A, S, C extends Comparable<C>, N>>
queue
Protected Constructors
protected
MultiobjectiveLS.Iterator
()
Public Methods
public
Map<S, Collection<N>>
getNonDominated
()
public
Queue<N>
getQueue
()
public
boolean
hasNext
()
Protected Methods
protected
Collection<N>
dominatedBy
(N node, Iterable<N> nonDominated)
protected
boolean
isDominated
(N node, Iterable<N> nonDominated)