Uses of Class
org.evoludo.simulator.geometries.AbstractGeometry
Packages that use AbstractGeometry
Package
Description
The GWT graphics for rendering and visualizing evolutionary models.
The toolkit to explore interactive evolutionary models.
Geometries for population interaction and competition graphs used by the
simulator.
The models that generate evolutionary trajectories based on the specifications of each module.
The modules to implement various evolutionary models.
The views to visualize results and interact with evolutionary models.
-
Uses of AbstractGeometry in org.evoludo.graphics
Fields in org.evoludo.graphics declared as AbstractGeometryModifier and TypeFieldDescriptionprotected AbstractGeometryGenericPopGraph.geometryThe structure of the population.Methods in org.evoludo.graphics that return AbstractGeometryModifier and TypeMethodDescriptionGenericPopGraph.getGeometry()Get the geometry backing the graph.Methods in org.evoludo.graphics with parameters of type AbstractGeometryModifier and TypeMethodDescriptionvoidGenericPopGraph.setGeometry(AbstractGeometry geometry) Set the geometry backing the graph.voidPopGraph2D.setGeometry(AbstractGeometry geometry) Constructors in org.evoludo.graphics with parameters of type AbstractGeometryModifierConstructorDescriptionNetwork2DGWT(EvoLudo engine, AbstractGeometry geometry) Create a new network in 2D for the given engine and geometry with a layouting process optimzed for GWT.Network3DGWT(EvoLudo engine, AbstractGeometry geometry) Create a new network in 3D for the given engine and geometry with a layouting process optimzed for GWT. -
Uses of AbstractGeometry in org.evoludo.simulator
Fields in org.evoludo.simulator declared as AbstractGeometryModifier and TypeFieldDescriptionprotected AbstractGeometryNetwork.geometryThe structure of the population.Methods in org.evoludo.simulator that return AbstractGeometryModifier and TypeMethodDescriptionNetwork.getGeometry()Get the geometry that is backing this network.Methods in org.evoludo.simulator with parameters of type AbstractGeometryModifier and TypeMethodDescriptionabstract Network2DEvoLudo.createNetwork2D(AbstractGeometry geometry) Generate 2D network.EvoLudoGWT.createNetwork2D(AbstractGeometry geometry) abstract Network3DEvoLudo.createNetwork3D(AbstractGeometry geometry) Generate 3D network.EvoLudoGWT.createNetwork3D(AbstractGeometry geometry) Constructors in org.evoludo.simulator with parameters of type AbstractGeometryModifierConstructorDescriptionprotectedNetwork(EvoLudo engine, AbstractGeometry geometry) Create a new network for the given engine and geometry.protectedNetwork2D(EvoLudo engine, AbstractGeometry geometry) Create a new network in 2D for the given engine and geometry.protectedNetwork3D(EvoLudo engine, AbstractGeometry geometry) Create a new network in 3D for the given engine and geometry. -
Uses of AbstractGeometry in org.evoludo.simulator.geometries
Subclasses of AbstractGeometry in org.evoludo.simulator.geometriesModifier and TypeClassDescriptionclassBase class for lattice-based geometries providing shared handling of fixed boundary flags and parsing utilities.classBase class for geometries constructed from specific degree distributions.classScale-free network following the Barabási & Albert preferential attachment process.classGeometry implementation for complete graphs where every node connects to every other node.classCubic lattice geometry (3D) with optional fixed boundaries.classGeometry implementation for the Desargues (Truncated Petersen) graph.classGeometry implementation for the dodecahedral graph.classGeometry wrapper representing dynamically changing structures provided by the simulation modules.classGeometry implementation for the Franklin graph (a 12-node cubic cage).classFrucht graph implementation.classGeometry implementation for the Heawood graph (14-node cubic symmetric graph).classHoneycomb/hexagonal lattice geometry with optional fixed boundaries.classHierarchical meta-population structure implementation.classGeometry implementation for the icosahedral graph (12 nodes, degree 5).classScale-free/small-world network following the Klemm & Eguíluz growth process.classLinear (1D lattice) geometry that supports asymmetric neighbourhoods and optional fixed boundaries.classSquare lattice with Moore neighbourhood (first and second nearest neighbours).classRandom directed graph geometry that wires a spanning tree first to ensure connectivity before adding remaining edges uniformly at random.classRandom (undirected) graph geometry that ensures the generated network is connected before sprinkling additional random edges.classRandom regular graph geometry that repeatedly samples degree distributions until a connected realization is found.classScale-free network that samples a power-law degree distribution and then constructs a matching undirected graph.classSquare lattice with second-neighbour von Neumann connectivity (diagonals only).classSquare lattice with arbitrary neighbourhood sizes.classStar geometry with node 0 as the hub connected to all leaves.classStrong undirected amplifier graph based on Giakkoupis (2016).classGeometry implementation for the strong suppressor graphs of Giakkoupis (2016).classDirected super-star geometry with configurable petals and amplification.classGeometry implementation for the Tietze graph (a cubic 12-node graph).classTriangular (hexagonal) lattice geometry supporting periodic or fixed boundaries.classSquare lattice with von Neumann neighbourhood (four nearest neighbours).classGeometry implementation for well-mixed (mean-field) populations.classWheel geometry: ring lattice plus central hub node 0 connected to every rim node.Methods in org.evoludo.simulator.geometries that return AbstractGeometryModifier and TypeMethodDescriptionAbstractGeometry.clone()Clone geometry.static AbstractGeometryInstantiate the requested geometry based oncli.static AbstractGeometryAbstractGeometry.create(EvoLudo engine, GeometryType type) Factory method for creating geometry instances by type.AbstractGeometry.deriveCompetitionGeometry()Derive competition geometry from current (interaction) geometry for inter-species interactions withisSingle == true.Methods in org.evoludo.simulator.geometries with parameters of type AbstractGeometryModifier and TypeMethodDescriptionstatic booleanAbstractGeometry.displaySingle(AbstractGeometry interaction, AbstractGeometry competition) Checks whether a single graphical representation can be used for the interaction and competition graphs.Constructors in org.evoludo.simulator.geometries with parameters of type AbstractGeometryModifierConstructorDescriptionGeometryFeatures(AbstractGeometry geometry) Evaluate geometry features for the given geometry. -
Uses of AbstractGeometry in org.evoludo.simulator.models
Fields in org.evoludo.simulator.models declared as AbstractGeometryModifier and TypeFieldDescriptionprotected AbstractGeometryIBSPopulation.competitionThe geometry of the competition graph.(package private) AbstractGeometryIBSGroup.geometryThe geometry associated with this group.protected AbstractGeometryIBSPopulation.interactionThe geometry of the interaction graph.protected AbstractGeometryPDE.spaceAbstractGeometry representing the spatial dimensions of this PDE.Methods in org.evoludo.simulator.models that return AbstractGeometryModifier and TypeMethodDescriptionIBSPopulation.getCompetitionGeometry()Gets the competition geometry.PDE.getGeometry()Gets the geometry representing the spatial structure of this PDE.IBSPopulation.getInteractionGeometry()Gets the interaction geometry.Methods in org.evoludo.simulator.models with parameters of type AbstractGeometryModifier and TypeMethodDescriptionprivate voidPDEInitialize.initFunction(double[][] density, double[] y0, AbstractGeometry space) Dispatch initialization based on the dimensionality of the geometry.private voidPDEInitialize.initFunction1D(double[][] density, double[] y0, AbstractGeometry space) Initialization forGeometryType.LINEARgeometries extracted to reduce complexity.private voidPDEInitialize.initFunction2D(double[][] density, double[] y0, AbstractGeometry space) Initialization for square/triangular/hexagonal lattice geometries extracted to reduce cognitive complexity.private voidPDEInitialize.initFunction3D(double[][] density, double[] y0, AbstractGeometry space) Initialization forGeometryType.CUBEgeometries extracted to reduce complexity.private voidPDEInitialize.initPerturbation(double[][] density, double[] y0, AbstractGeometry space) Initialize a uniform background with a single perturbed site at the center.private voidPDEInitialize.initRandom(double[][] density, double[] y0, AbstractGeometry space) Initialize each site independently at random (normalized if needed).private voidPDEInitialize.initUniform(double[][] density, double[] y0, AbstractGeometry space) Initialize every lattice point with the same state.voidIBSGroup.setGeometry(AbstractGeometry geometry) Set the geometry associated with this group. -
Uses of AbstractGeometry in org.evoludo.simulator.modules
Fields in org.evoludo.simulator.modules declared as AbstractGeometryModifier and TypeFieldDescriptionprotected AbstractGeometryModule.structureThe geometry of population (interaction and competition graphs are the same)Methods in org.evoludo.simulator.modules that return AbstractGeometry -
Uses of AbstractGeometry in org.evoludo.simulator.views
Methods in org.evoludo.simulator.views that return AbstractGeometryModifier and TypeMethodDescriptionprivate AbstractGeometryDistribution.createGeometry(int nTraits) Create a geometry for the given number of traits.Methods in org.evoludo.simulator.views with parameters of type AbstractGeometryModifier and TypeMethodDescriptionprivate static StringBuilderGenericPop.appendCompNeighborsAt(int node, AbstractGeometry geom, StringBuilder tip) Append competition neighbours at the given node.private static StringBuilderGenericPop.appendInterNeighborsAt(int node, AbstractGeometry geom, StringBuilder tip) Append interaction neighbours at the given node.private StringBuilderGenericPop.appendOppTraitsAt(int node, AbstractGeometry geom, G graph, StringBuilder tip) Append opponent traits at the given node.private double[][]Histogram.ensureDegreeData(HistoGraph graph, AbstractGeometry inter, AbstractGeometry comp, double[][] data) Ensure the provided data buffer is sized appropriately for the given interaction/competition geometries, update the histogram data and set axis limits on the graph; returns the (possibly new) data buffer.private intHistogram.getDegreeBins(AbstractGeometry inter, AbstractGeometry comp) Determine the number of bins required for the degree distributions of the interaction and competition geometries.private intHistogram.getDegreeGraphs(AbstractGeometry inter, AbstractGeometry comp) Determine the number of histograms required for the degree distributions of the interaction and competition geometries.private voidHistogram.getDegreeHistogramData(double[][] data, AbstractGeometry geometry, int idx, double ibinwidth) Generate the degree histogram data for the given geometry.private voidHistogram.getDegreeHistogramData(double[][] data, AbstractGeometry inter, AbstractGeometry comp) Generate the degree histogram data for the given interaction and competition geometries.private StringGenericPop.tooltipForPDE(int node, int nNodes, AbstractGeometry geometry, Module<?> module, G graph, StringBuilder tip) Assemble tooltip for PDE models.