Class NDTree<S extends Solution<S,I>,I extends Instance>

java.lang.Object
es.urjc.etsii.grafo.mo.pareto.ParetoSet<S,I>
es.urjc.etsii.grafo.mo.pareto.NDTree<S,I>

public class NDTree<S extends Solution<S,I>,I extends Instance> extends ParetoSet<S,I>
  • Constructor Details

    • NDTree

      public NDTree(int numberOfObjectives)
    • NDTree

      public NDTree(int numberOfObjectives, int maxListSizePerNode, int numberOfChildrenPerNode)
  • Method Details

    • add

      public boolean add(double[] s)
      Specified by:
      add in class ParetoSet<S extends Solution<S,I>,I extends Instance>
    • stream

      public Stream<double[]> stream()
      Specified by:
      stream in class ParetoSet<S extends Solution<S,I>,I extends Instance>
    • getEstimatedIdeal

      public double[] getEstimatedIdeal()
    • getEstimatedNadir

      public double[] getEstimatedNadir()
    • getMidpoint

      public double[] getMidpoint()
    • size

      public int size()
      Specified by:
      size in class ParetoSet<S extends Solution<S,I>,I extends Instance>
    • clear

      public void clear()
      Overrides:
      clear in class ParetoSet<S extends Solution<S,I>,I extends Instance>
    • getExtremeMember

      public double[] getExtremeMember(int index)
      Returns the solution extremising the index objective