Class CompleteGeometry
Object
AbstractGeometry
CompleteGeometry
Geometry implementation for complete graphs where every node connects to
every other node.
- See Also:
-
Field Summary
Fields inherited from class AbstractGeometry
connectivity, EMPTY_LINKS, engine, features, in, isInterspecies, isRegular, isRewired, isSingle, isUndirected, isValid, kin, kout, logger, name, network2D, network3D, out, pAddwire, pRewire, size, specs, type -
Constructor Summary
ConstructorsConstructorDescriptionCompleteGeometry(EvoLudo engine) Create a complete-graph geometry for the given engine. -
Method Summary
Modifier and TypeMethodDescriptionprotected booleanHook for subclasses to implement geometry specific checks.voidinit()Generates a complete graph where every node is connected to every other node.Methods inherited from class AbstractGeometry
addDirected, addEdgeAt, addLinkAt, addUndirected, alloc, check, clearLinksFrom, clearLinksTo, clone, create, create, decodeGeometry, deriveCompetitionGeometry, displaySingle, encodeGeometry, enforceSize, equals, getAddwire, getConnectivity, getEncodeKey, getFeatures, getLabel, getName, getNetwork2D, getNetwork3D, getRewire, getSize, getSpecs, getType, hashCode, isConsistent, isGraphConnected, isInterspecies, isLattice, isNeighborOf, isRegular, isRewired, isSingle, isType, isUndirected, isUnique, parse, parse, removeEdgeAt, removeLinkAt, rewire, rewireDirected, rewireEdgeAt, rewireLinkAt, rewireUndirected, setAddwire, setConnectivity, setInterspecies, setName, setNetwork2D, setNetwork3D, setRewire, setSingle, setSize, setType, swapEdges, usage, warn
-
Constructor Details
-
CompleteGeometry
Create a complete-graph geometry for the given engine.- Parameters:
engine- EvoLudo pacemaker
-
-
Method Details
-
checkSettings
protected boolean checkSettings()Description copied from class:AbstractGeometryHook for subclasses to implement geometry specific checks.- Overrides:
checkSettingsin classAbstractGeometry- Returns:
trueif adjustments require a reset
-
init
public void init()Generates a complete graph where every node is connected to every other node. This mirrors well-mixed (unstructured) populations with the exception that the focal node itself can be excluded from replacement (e.g. Moran birth-death updates) while still retaining explicit neighbourhoods.- Specified by:
initin classAbstractGeometry- See Also:
-