Package org.evoludo.simulator.geometries
package org.evoludo.simulator.geometries
Geometries for population interaction and competition graphs used by the
simulator. This package provides the abstract base classes and concrete
implementations for well-mixed populations, lattices, a selection of special
graphs (including Frucht, Heawood, Tietze and others), amplifiers/suppressors
of selection, random and scale-free networks, plus utilities to configure and
describe geometry-specific features.
-
ClassDescriptionAbstract implementation of the population interaction and competition structures.Base class for lattice-based geometries providing shared handling of fixed boundary flags and parsing utilities.Base class for geometries constructed from specific degree distributions.Scale-free network following the Barabási & Albert preferential attachment process.Geometry implementation for complete graphs where every node connects to every other node.Cubic lattice geometry (3D) with optional fixed boundaries.Geometry implementation for the Desargues (Truncated Petersen) graph.Geometry implementation for the dodecahedral graph.Geometry wrapper representing dynamically changing structures provided by the simulation modules.Geometry implementation for the Franklin graph (a 12-node cubic cage).Frucht graph implementation.Encapsulates frequently used geometry statistics such as minimal or maximal degrees.The types of graph geometries.Geometry implementation for the Heawood graph (14-node cubic symmetric graph).Honeycomb/hexagonal lattice geometry with optional fixed boundaries.Hierarchical meta-population structure implementation.Geometry implementation for the icosahedral graph (12 nodes, degree 5).Scale-free/small-world network following the Klemm & Eguíluz growth process.Linear (1D lattice) geometry that supports asymmetric neighbourhoods and optional fixed boundaries.Square lattice with Moore neighbourhood (first and second nearest neighbours).Random directed graph geometry that wires a spanning tree first to ensure connectivity before adding remaining edges uniformly at random.Random (undirected) graph geometry that ensures the generated network is connected before sprinkling additional random edges.Random regular graph geometry that repeatedly samples degree distributions until a connected realization is found.Scale-free network that samples a power-law degree distribution and then constructs a matching undirected graph.Square lattice with second-neighbour von Neumann connectivity (diagonals only).Square lattice with arbitrary neighbourhood sizes.Star geometry with node 0 as the hub connected to all leaves.Strong undirected amplifier graph based on Giakkoupis (2016).Geometry implementation for the strong suppressor graphs of Giakkoupis (2016).Directed super-star geometry with configurable petals and amplification.Geometry implementation for the Tietze graph (a cubic 12-node graph).Triangular (hexagonal) lattice geometry supporting periodic or fixed boundaries.Square lattice with von Neumann neighbourhood (four nearest neighbours).Geometry implementation for well-mixed (mean-field) populations.Wheel geometry: ring lattice plus central hub node 0 connected to every rim node.