Package org.evoludo.simulator
Enum Class Geometry.Type
- All Implemented Interfaces:
Serializable
,Comparable<Geometry.Type>
,Constable
,CLOption.Key
- Enclosing class:
Geometry
The types of graph geometries. Currently available graph geometries are:
- MEANFIELD
- mean-field/well-mixed population
- COMPLETE
- complete graph (connectivity \(k=N-1\))
- HIERARCHY
- hierarchical (meta-)populations
- STAR
- star graph (single hub)
- WHEEL
- wheel (cycle with single hub)
- SUPER_STAR
- super-star (single hub, petals
- STRONG_AMPLIFIER
- strong (undirected) amplifier
- STRONG_SUPPRESSOR
- strong (undirected) suppressor
- LINEAR
- linear lattice, 1D
- SQUARE_NEUMANN
- square lattice, 2D (von neumann neighbourhood, nearest neighbours, connectivity \(k=4\))
- SQUARE_NEUMANN_2ND
- square lattice, 2D (second nearest neighbours, connectivity \(k=4\))
- SQUARE_MOORE
- square lattice, 2D (moore neighbourhood, first and second nearest neighbours, connectivity \(k=8\))
- SQUARE
- square lattice, 2D
- CUBE
- cubic lattice, 3D
- HONEYCOMB
- hexagonal/honeycomb lattice (connectivity \(k=6\))
- TRIANGULAR
- triangular lattice (connectivity \(k=3\))
- FRUCHT
- Frucht graph, \(N=12, k=3\)
- TIETZE
- Tietze graph \(N=12, k=3\)
- FRANKLIN
- Franklin graph \(N=12, k=3\)
- HEAWOOD
- Heawood graph \(N=14, k=3\)
- ICOSAHEDRON
- Icosahedron graph \(N=12, k=5\)
- DODEKAHEDRON
- Dodekahedron graph \(N=20, k=3\)
- DESARGUES
- Desargues graph \(N=20, k=3\)
- RANDOM_GRAPH
- random graph
- RANDOM_GRAPH_DIRECTED
- directed random graph
- RANDOM_REGULAR_GRAPH
- random regular graph
- SCALEFREE
- scale-free graph
- SCALEFREE_BA
- scale-free graph, Barabasi & Albert
- SCALEFREE_KLEMM
- scale-free graph, Klemm & Eguiluz
-
Nested Class Summary
Nested classes/interfaces inherited from class Enum
Enum.EnumDesc<E extends Enum<E>>
-
Enum Constant Summary
Enum ConstantsEnum ConstantDescriptionComplete graph, connectivity \(k=N-1\).Cubic lattice, 3D.Desargues graph, size \(N=20\), connectivity \(k=3\).Dodekahedron graph, size \(N=20\), connectivity \(k=3\).Dynamically changeing network structure.Franklin graph, size \(N=12\), connectivity \(k=3\).Frucht graph, size \(N=12\), connectivity \(k=3\).Placeholder for generic geometry.Heawood graph, size \(N=14\), connectivity \(k=3\).Hierarchical (meta-)populations.Hexagonal (honeycomb) lattice, connectivity \(k=6\).Icosahedron graph, size \(N=12\), connectivity \(k=5\).Placeholder for invalid geometry.Linear lattice, 1D.Mean-field/well-mixed population.Random graph.Directed random graph.Random regular graph.Scale-free network.Scale-free network.Scale-free network.Square lattice, 2D.Square lattice (Moore neighbourhood).Square lattice (von Neumann neighbourhood).Square lattice.Star graph, connectivity \(k=2(N-1)/N\).Strong (undirected) amplifier.Strong (undirected) suppressor.Superstar graph (single hub, petals).Tietze's graph, size \(N=12\), connectivity \(k=3\).Triangular lattice, connectivity \(k=3\).Placeholder for empty geometry.Wheel graph, connectivity \(k=4(N-1)/N\). -
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionOptional: long description of purpose of this key.getKey()
Return key of in this collection.getTitle()
Brief description of purpose of this key.boolean
Check if the geometry is a lattice.boolean
Check if the geometry is a square lattice.toString()
static Geometry.Type
Returns the enum constant of this class with the specified name.static Geometry.Type[]
values()
Returns an array containing the constants of this enum class, in the order they are declared.
-
Enum Constant Details
-
MEANFIELD
Mean-field/well-mixed population.- See Also:
-
COMPLETE
Complete graph, connectivity \(k=N-1\).- See Also:
-
HIERARCHY
Hierarchical (meta-)populations. Supported sub-population types are:M
: well-mixed (default)n
: square lattice (von neumann)m
: square lattice (moore)
f
for fixed lattice boundaries. The hierarchical populations are specified as a vector with the format<n1>[,<n2>[...,<nm>]]w
whereni
refers to the number of units in leveli
. There is a total ofm+1
levels withnPopulation/(n1*...*nm)
individuals in the last level (smallest unit). The strength of interaction between levels isw
.- See Also:
-
LINEAR
Linear lattice, 1D.l<l>[,<r>]
specifies a linear lattice withl
neighbours to the left andr
to the right. Ifr
is missing orr==l
the neighbourhood is symmetric.- See Also:
-
SQUARE_NEUMANN
Square lattice (von Neumann neighbourhood). Four nearest neighbours (north, east, south, west).- See Also:
-
SQUARE_NEUMANN_2ND
Square lattice. Four second-nearest neighbours (north-east, north-west, south-west, south-east).- See Also:
-
SQUARE_MOORE
Square lattice (Moore neighbourhood). Eight nearest neighbours (chess kings moves).- See Also:
-
SQUARE
Square lattice, 2D.N<n>
specifies a square lattice withn
neighbours, wheren
is3x3, 5x5...
.- See Also:
-
CUBE
Cubic lattice, 3D.C<n>
cubic lattice withn
neighbours, wheren
is2+2+2, 3x3x3, 5x5x5...
.- See Also:
-
HONEYCOMB
Hexagonal (honeycomb) lattice, connectivity \(k=6\).- See Also:
-
TRIANGULAR
Triangular lattice, connectivity \(k=3\).- See Also:
-
FRUCHT
Frucht graph, size \(N=12\), connectivity \(k=3\).- See Also:
-
TIETZE
Tietze's graph, size \(N=12\), connectivity \(k=3\).- See Also:
-
FRANKLIN
Franklin graph, size \(N=12\), connectivity \(k=3\).- See Also:
-
HEAWOOD
Heawood graph, size \(N=14\), connectivity \(k=3\).- See Also:
-
ICOSAHEDRON
Icosahedron graph, size \(N=12\), connectivity \(k=5\).- See Also:
-
DODEKAHEDRON
Dodekahedron graph, size \(N=20\), connectivity \(k=3\).- See Also:
-
DESARGUES
Desargues graph, size \(N=20\), connectivity \(k=3\).- See Also:
-
STAR
Star graph, connectivity \(k=2(N-1)/N\).- See Also:
-
SUPER_STAR
Superstar graph (single hub, petals).S<p[,k]>
superstar graph withp
petals and amplificationk
.- See Also:
-
WHEEL
Wheel graph, connectivity \(k=4(N-1)/N\).- See Also:
-
STRONG_AMPLIFIER
Strong (undirected) amplifier.- See Also:
-
STRONG_SUPPRESSOR
Strong (undirected) suppressor.- See Also:
-
RANDOM_REGULAR_GRAPH
Random regular graph.- See Also:
-
RANDOM_GRAPH
Random graph.R<d>
random graph with degreed
.- See Also:
-
RANDOM_GRAPH_DIRECTED
Directed random graph.D<d>
random graph with degreed
.- See Also:
-
SCALEFREE
Scale-free network.p<e>
scale-free network with exponente
.- See Also:
-
SCALEFREE_KLEMM
Scale-free network.F<n[,p]>
scale-free network with degreen
and a fraction ofp
random links.- See Also:
-
SCALEFREE_BA
Scale-free network.f<d>
scale-free network with degreed
.- See Also:
-
DYNAMIC
Dynamically changeing network structure.- See Also:
-
VOID
Placeholder for empty geometry. Not user selectable. -
GENERIC
Placeholder for generic geometry. Not user selectable. -
INVALID
Placeholder for invalid geometry. Not user selectable.
-
-
Field Details
-
Constructor Details
-
Type
Instantiate new type of geometry.- Parameters:
key
- identifier for parsing of command line optiontitle
- the summary of geometry for GUI and help display
-
Type
Instantiate new geometry type.- Parameters:
key
- the identifier for parsing of command line optionstitle
- the summary of the geometry for GUI and help displaydescription
- the optional description of geometry
-
-
Method Details
-
values
Returns an array containing the constants of this enum class, in the order they are declared.- Returns:
- an array containing the constants of this enum class, in the order they are declared
-
valueOf
Returns the enum constant of this class with the specified name. The string must match exactly an identifier used to declare an enum constant in this class. (Extraneous whitespace characters are not permitted.)- Parameters:
name
- the name of the enum constant to be returned.- Returns:
- the enum constant with the specified name
- Throws:
IllegalArgumentException
- if this enum class has no constant with the specified nameNullPointerException
- if the argument is null
-
getKey
Description copied from interface:CLOption.Key
Return key of in this collection. Used when parsing command line options.- Specified by:
getKey
in interfaceCLOption.Key
- Returns:
- the key of the command line option
-
getTitle
Description copied from interface:CLOption.Key
Brief description of purpose of this key. Used in GUI and in help display.- Specified by:
getTitle
in interfaceCLOption.Key
- Returns:
- the title of the command line option
- See Also:
-
getDescription
Description copied from interface:CLOption.Key
Optional: long description of purpose of this key. Used in help display. Defaults to brief description.- Specified by:
getDescription
in interfaceCLOption.Key
- Returns:
- the description of the command line option
- See Also:
-
isSquareLattice
public boolean isSquareLattice()Check if the geometry is a square lattice.- Returns:
true
if the geometry is a square lattice
-
isLattice
public boolean isLattice()Check if the geometry is a lattice.- Returns:
true
if the geometry is a lattice
-
toString
- Overrides:
toString
in classEnum<Geometry.Type>
-