Enum Class Geometry.Type

All Implemented Interfaces:
Serializable, Comparable<Geometry.Type>, Constable, CLOption.Key
Enclosing class:
Geometry

public static enum Geometry.Type extends Enum<Geometry.Type> implements CLOption.Key
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