public class

MultiobjectiveLS.Iterator

extends Object
implements Iterator<E>
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

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
MultiobjectiveLS.Iterator()
Public Methods
Map<S, Collection<N>> getNonDominated()
Queue<N> getQueue()
boolean hasNext()
N next()
void remove()
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
From interface java.util.Iterator

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

public N next ()

public void remove ()

Protected Methods

protected Collection<N> dominatedBy (N node, Iterable<N> nonDominated)

protected boolean isDominated (N node, Iterable<N> nonDominated)