| Class | Description |
|---|---|
| CommunicationGraph |
A CommunicationGraph is a SocialGraph which formalizes the semantics for communicative activities between ConsumerAgents.
|
| ConstantEdgeWeightManipulationScheme |
EdgeWeightManipulationScheme that assigns a constant weight to an edge.
|
| EdgeWeightManipulationScheme |
Calculates an edge weight for a SNEdge based on agent group, distance and other factors.
|
| ErdosRenyiCommunicationGraph |
The ErdosRenyiCommunicationGraph is a graph whose edges are all communicative edges and whose topology
is initialized after the Erdös-Rényi random model, i.e.
|
| ExponentialDecayCommunicationGraph | |
| GilbertCommunicationGraph |
The GilbertCommunicationGraph is a graph whose edges are all communicative edges and whose topology
is initialized after the Gilbert random model, i.e.
|
| HeterogeneousExponentialDecaySN | |
| HeterogeneousMannaSenYookSN | |
| HeterogeneousNewtonianInversePowerlawCommunicationGraph | |
| HeterogeneousRegularCommunicationGraph |
A HeterogeneousRegularCommunicationGraph is a communication graph, whose nodes correspond to
agents of different agent groups, which tries to be as regular as possible.
|
| HeterogeneousScalefreeCommunicationGraph | |
| HeterogeneousSmallWorldCommunicationGraph | |
| MannaSenYookCommunicationGraph | |
| MannaSenYookPseudoCountCommunicationGraph | |
| NewtonianInversePowerlawCommunicationGraph | |
| RandomInDelTMS |
The RandomInDel TopologyManipulationScheme is a TMS in which every edge present in the graph will be
deleted with a given, uniform probability, and every possible edge is created with a given, uniform probability.
|
| RandomInDelTMSCommunication |
This TopologyManipulationScheme is a TMS in which every edge of the communication medium present in the graph will be
deleted with a given, uniform probability, and every possible edge of the communication medium is created with a given, uniform probability.
|
| RandomRewireTMS |
TopologyManipulationScheme that randomly rewires the edges in the network,
i.e.
|
| RegularCommunicationGraph |
A RegularCommunicationGraph is a graph where each node is connected to a number of 'adjacent' nodes (via communicative edges),
given by the parameter z.
|
| ScalefreeCommunicationGraph | |
| ScalefreePseudoCountCommunicationGraph | |
| SmallWorldCommunicationGraph | |
| SNCommunicationEdge |
The SNCommunicationEdge is an edge in the social graph for the communication medium,
i.e.
|
| SNConfiguration |
Class to represent the configuration of the social network.
|
| SNConsumerConsumerEdge | |
| SNConsumerNode | |
| SNEdge |
A SNEdge represents an edge within a social network (or more precise in a SocialGraph).
|
| SNFactory |
Class to bundle all process relevant for the initialization of the SocialNetwork base on the configuration of the concrete social network
|
| SNNode | |
| SNTrustEdge |
A trust edge is an edge within a SocialGraph that formalizes the trust relation between
two ConsumerAgents (source nodes trusts target node), and is thus an edge associated with the medium 'TRUST'.
|
| SocialGraph |
The SocialGraph describes the structure of the interaction of the ConsumerAgents within the simulation.
|
| SocialNetwork |
A SocialNetwork describes the structure of interaction between ConsumerAgents.
|
| SpatialHeterogeneousRegularSN | |
| SpatialHeterogeneousScalefreeSN | |
| SpatialHeterogeneousSmallWorldSN | |
| SpatialRegularSN | |
| SpatialSmallWorldSN | |
| TopologyManipulationScheme |
A TopologyManipulationScheme describes how the topology of a SocialGraph changes over time.
|
| TrustGraph |
A TrustGraph is a SocialGraph which formalizes the semantics for trust between ConsumerAgents.
|
| Enum | Description |
|---|---|
| SocialGraph.EDGEMEDIUM |