DiscreteUnitSimplex

mgo.evolution.algorithm.NSGA3Operations.DiscreteUnitSimplex
See theDiscreteUnitSimplex companion class

Attributes

Companion
class
Graph
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type

Members list

Type members

Inherited types

type MirroredElemLabels <: Tuple

The names of the product elements

The names of the product elements

Attributes

Inherited from:
Mirror
type MirroredLabel <: String

The name of the type

The name of the type

Attributes

Inherited from:
Mirror

Value members

Concrete methods

def apply(dimension: Int, divisions: Int): DiscreteUnitSimplex

recursive constructor two complementary hypersimplices are sufficient to generate the simplex in the next dimension (brutal algorithm by filtering points - still a polynomial upper bound)

recursive constructor two complementary hypersimplices are sufficient to generate the simplex in the next dimension (brutal algorithm by filtering points - still a polynomial upper bound)

Value parameters

dimension

dimension

divisions

number of divisions

Attributes

def twoDimSimplex(divisions: Int): DiscreteUnitSimplex

basic case : two dimensional simplex

basic case : two dimensional simplex

Value parameters

divisions

divisions

Attributes