IRPact_modellierung.network

Class RegularCommunicationGraph

java.lang.Object

IRPact_modellierung.SimulationEntity

IRPact_modellierung.network.SocialGraph

IRPact_modellierung.network.CommunicationGraph

IRPact_modellierung.network.RegularCommunicationGraph

public class RegularCommunicationGraph
extends CommunicationGraph

A RegularCommunicationGraph is a graph where each node is connected to a number of 'adjacent' nodes (via communicative edges), given by the parameter z. The order chosen for this is the ID of the nodes by which they are ordered. The number of adjacent nodes a node is connected to is given by the parameter 'z'

Nested Class Summary

Nested classes/interfaces inherited from class IRPact_modellierung.network.SocialGraph

SocialGraph.EDGEMEDIUM

Field Summary

Fields inherited from class IRPact_modellierung.network.SocialGraph

edges, neighbours, nodes, outgoingEdges, outgoingEdgesMedium

Fields inherited from class IRPact_modellierung.SimulationEntity

associatedSimulationContainer

Constructor Summary

Constructors

Constructor and Description
RegularCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, int numberOfNodes)
RegularCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, java.util.Set<SNNode> initialNodes)
RegularCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, java.util.Set<SNNode> nodes, java.util.Set<SNEdge> edges, java.util.HashMap<SNNode,java.util.Set<SNNode>> neighbours)

Method Summary

Modifier and Type	Method and Description
void	addNodes(SNConfiguration sNconfiguration, java.util.Set<SNNode> nodesToAdd) A (directed) regular graph is characterized by the property that every node has the same in- as out-degree as every other node, and that these are equal.
java.util.Set<SNEdge>	createEdges(SNConfiguration sNConfiguration, java.util.Set<SNNode> initialNodes) (Network type specific) method to generate edges between a set of initial nodes.
static java.util.Set<SNEdge>	createStaticEdges(int z, java.util.Set<SNNode> initialNodes, EdgeWeightManipulationScheme edgeWeightMappingScheme)
int	getZ()

Methods inherited from class IRPact_modellierung.network.CommunicationGraph

getCommunicationNeighbours, getCommunicationNeighbours

Methods inherited from class IRPact_modellierung.network.SocialGraph

addEdge, addIsolatedNode, getAllMediaNeighbours, getEdges, getNeighbours, getNeighbours, getNeighbours, getNeighbours, getNodes, modifyEdgeMedium, modifyEdgeNodes, modifyEdgeSource, modifyEdgeTarget, removeEdge, replaceEdge, retrieveAllEdges, retrieveEdge

Methods inherited from class IRPact_modellierung.SimulationEntity

getAssociatedSimulationContainer

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

RegularCommunicationGraph

public RegularCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 java.util.Set<SNNode> nodes,
                                 java.util.Set<SNEdge> edges,
                                 java.util.HashMap<SNNode,java.util.Set<SNNode>> neighbours)

RegularCommunicationGraph

public RegularCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 java.util.Set<SNNode> initialNodes)

RegularCommunicationGraph

public RegularCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 int numberOfNodes)

Method Detail

getZ

public int getZ()

addNodes

public void addNodes(SNConfiguration sNconfiguration,
                     java.util.Set<SNNode> nodesToAdd)
              throws java.lang.IllegalArgumentException,
                     java.lang.UnsupportedOperationException

A (directed) regular graph is characterized by the property that every node has the same in- as out-degree as every other node, and that these are equal. Adding nodes to a regular graph needs to retain this property. In graph initialization, this is achieved by assigning an order to the nodes, and connecting each node to the 'next nodes' (by modulo). Adding nodes to the graph through this method is done with the following algorithm: For all nodes to add: 1. Find any node (called the anchor) node which will become the node sharing no neighbours with the new node, but have the node to add as neighbour. 2. (After adding the new node to the graph), this node will be unique, since all other nodes having the new node as neighbour share at least one other neighbour with the new node. 3. Construct an ordered list of all neighbours of the anchor node (the neighbourList), ordered by the number of neighbours in common with the anchor node. There will be exactly one node for all k \in [1:z]. These are the nodes whose neighbour list needs to change. 4. Identify the node whose in-arcs need to be set to the the node to add, called the nodeToReplace. This node is given by the property that it is the common neighbour of all nodes in the neighbourList. 5. Change the targetNode of the arcs from nodes in the neighbourList to the nodeToReplace with the nodeToAdd, resetting the weight and label where necessary 6. Change the targetNodes of the nodes not shared by all neighbours 7. Create the arcs from the nodeToAdd to all neighbouring nodes of the nodeToReplace except for the one not in the union of the nodes in the neighbourList, as well to the nodeToReplace.

Overrides:

addNodes in class SocialGraph

Parameters:

sNconfiguration - The configuration the social graph is based on

nodesToAdd - The nodes to be added to the social graph

Throws:

java.lang.IllegalArgumentException

java.lang.UnsupportedOperationException

createEdges

public java.util.Set<SNEdge> createEdges(SNConfiguration sNConfiguration,
                                         java.util.Set<SNNode> initialNodes)

Description copied from class: SocialGraph

(Network type specific) method to generate edges between a set of initial nodes. Specifies how edges are (initially) created. Generated edges need to be included in the neighbourhood relations (method only derives WHICH edges to create).

Specified by:

createEdges in class SocialGraph

Parameters:

sNConfiguration - The configuration of the social graph of interest

initialNodes - The nodes the social graph should be initialized with

Returns:

A set of edges of the social graph it is initialized with

createStaticEdges

public static java.util.Set<SNEdge> createStaticEdges(int z,
                                                      java.util.Set<SNNode> initialNodes,
                                                      EdgeWeightManipulationScheme edgeWeightMappingScheme)