public class

MultiobjectiveLS

extends Algorithm<A, S, N extends Node<A, S, N>>
java.lang.Object
   ↳ es.usc.citius.hipster.algorithm.Algorithm<A, S, N extends es.usc.citius.hipster.model.Node<A, S, N>>
     ↳ es.usc.citius.hipster.algorithm.MultiobjectiveLS<A, S, C extends java.lang.Comparable<C>, N extends es.usc.citius.hipster.model.HeuristicNode<A, S, C, N>>

Class Overview

Implementation of the multi-objective label setting algorithm described by Martins and Santos.

Original paper: Martins, E. D. Q. V., & Santos, J. L. E. (1999). "The labeling algorithm for the multiobjective shortest path problem". Departamento de Matematica, Universidade de Coimbra, Portugal, Tech. Rep. TR-99/005.

Summary

Nested Classes
class MultiobjectiveLS.Iterator MultiobjectiveLS iterator. 
Fields
protected N extends HeuristicNode<A, S, C extends Comparable<C>, N> initialNode
protected NodeExpander<A, S, N extends HeuristicNode<A, S, C extends Comparable<C>, N>> nodeExpander
Public Constructors
MultiobjectiveLS(N initialNode, NodeExpander<A, S, N> nodeExpander)
Public Methods
Iterator<N> iterator()
SearchResult search(Predicate<N> condition)
Executes the search algorithm until the predicate condition is satisfied or there are no more nodes to explore.
[Expand]
Inherited Methods
From class es.usc.citius.hipster.algorithm.Algorithm
From class java.lang.Object
From interface java.lang.Iterable

Fields

protected N extends HeuristicNode<A, S, C extends Comparable<C>, N> initialNode

protected NodeExpander<A, S, N extends HeuristicNode<A, S, C extends Comparable<C>, N>> nodeExpander

Public Constructors

public MultiobjectiveLS (N initialNode, NodeExpander<A, S, N> nodeExpander)

Public Methods

public Iterator<N> iterator ()

public SearchResult search (Predicate<N> condition)

Executes the search algorithm until the predicate condition is satisfied or there are no more nodes to explore.

Parameters
condition predicate with the boolean condition.