|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectde.cesr.more.rs.network.MRsEncapsulatedContextJungNetwork<AgentT,EdgeT>
AgentT - public final class MRsEncapsulatedContextJungNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
Network Adapter for Repast Simphony models. Encapsulates a ContextJungNetwork. TODO handle edge objects to deal with weights etc... and allow more complex edge objects. TODO error handling for missing nodes TODO comment
MRsContextJungNetwork| Field Summary | |
|---|---|
static double |
DEFAULT_EDGE_WEIGHT
|
protected MoreEdgeFactory<AgentT,EdgeT> |
edgeFac
|
protected Class<? extends MoreNetworkBuilder<?,?>> |
networkBuilderClass
|
| Constructor Summary | |
|---|---|
MRsEncapsulatedContextJungNetwork(repast.simphony.context.space.graph.ContextJungNetwork<AgentT> network,
repast.simphony.context.Context<AgentT> context)
Adds the encapsulated network as projection to the given context. |
|
| Method Summary | |
|---|---|
EdgeT |
addEdge(AgentT source,
AgentT target)
|
void |
addNode(AgentT node)
Add a node to the network. |
protected void |
checkVertex(AgentT ego)
|
EdgeT |
connect(AgentT source,
AgentT target)
If there is already a connection object between these nodes it is removed and the given one added. |
void |
connect(EdgeT edge)
Adds an edge to this network. |
boolean |
containsNode(AgentT node)
Return true if the given node is contained within this network |
EdgeT |
disconnect(AgentT source,
AgentT target)
|
Iterable<AgentT> |
getAdjacent(AgentT ego)
|
int |
getDegree(AgentT ego)
|
EdgeT |
getEdge(AgentT source,
AgentT target)
|
Collection<EdgeT> |
getEdgesCollection()
|
MoreNetwork<AgentT,EdgeT> |
getGraphFilteredInstance(Graph<AgentT,EdgeT> graph,
String newName)
The method is used to obtain a new Sub-MoreNetwork. |
int |
getInDegree(AgentT ego)
|
Graph<AgentT,EdgeT> |
getJungGraph()
Return a JUNG Graph object of this network. |
String |
getName()
|
repast.simphony.context.space.graph.ContextJungNetwork<AgentT> |
getNetwork()
|
Class<? extends MoreNetworkBuilder<?,?>> |
getNetworkBuilderClass()
|
String |
getNetworkInfo()
Provides some basic oinformation on the network: - number of links - number of edges - directedness |
Iterable<AgentT> |
getNodes()
|
int |
getOutDegree(AgentT ego)
|
Iterable<AgentT> |
getPredecessors(AgentT ego)
|
AgentT |
getRandomPredecessor(AgentT ego)
Return a random neighbour. |
AgentT |
getRandomSuccessor(AgentT ego)
Return a random neighbour. |
Iterable<AgentT> |
getSuccessors(AgentT ego)
|
double |
getWeight(AgentT source,
AgentT target)
|
boolean |
isAdjacent(AgentT ego,
AgentT alter)
|
boolean |
isDirected()
|
boolean |
isSuccessor(AgentT alter,
AgentT ego)
Checks whether there is a link from ego to alter. |
void |
normalizeWeights()
Normalises the edges' weights by dividing by the largest weight. |
int |
numEdges()
|
int |
numNodes()
|
void |
removeNode(AgentT node)
Removes a node and all its edges from the network. |
void |
reverseNetwork()
Returns a reversed network, i.e. for all edges source and target vertices are exchanged. |
void |
setEdgeFactory(MoreEdgeFactory<AgentT,EdgeT> edgeFac)
Sets the MoreEdgeFactory that is used to connect agents. |
void |
setNetworkBuilderClass(Class<? extends MoreNetworkBuilder<?,?>> builderClass)
|
void |
setWeight(AgentT source,
AgentT target,
double weight)
|
String |
toString()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
protected MoreEdgeFactory<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>> edgeFac
public static double DEFAULT_EDGE_WEIGHT
protected Class<? extends MoreNetworkBuilder<?,?>> networkBuilderClass
| Constructor Detail |
|---|
public MRsEncapsulatedContextJungNetwork(repast.simphony.context.space.graph.ContextJungNetwork<AgentT> network,
repast.simphony.context.Context<AgentT> context)
network - the network that is going to be wrapped| Method Detail |
|---|
public EdgeT connect(AgentT source,
AgentT target)
MoreNetwork
connect in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public EdgeT disconnect(AgentT source,
AgentT target)
disconnect in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public Iterable<AgentT> getAdjacent(AgentT ego)
getAdjacent in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public int getDegree(AgentT ego)
getDegree in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public int getInDegree(AgentT ego)
getInDegree in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public String getName()
getName in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public Iterable<AgentT> getNodes()
getNodes in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public int getOutDegree(AgentT ego)
getOutDegree in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public Iterable<AgentT> getPredecessors(AgentT ego)
getPredecessors in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>protected void checkVertex(AgentT ego)
ego - public Iterable<AgentT> getSuccessors(AgentT ego)
getSuccessors in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public double getWeight(AgentT source,
AgentT target)
getWeight in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public boolean isAdjacent(AgentT ego,
AgentT alter)
isAdjacent in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public boolean isDirected()
isDirected in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public void normalizeWeights()
MoreNetwork
normalizeWeights in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public int numEdges()
numEdges in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public int numNodes()
numNodes in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public void setWeight(AgentT source,
AgentT target,
double weight)
setWeight in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public AgentT getRandomSuccessor(AgentT ego)
MoreNetwork
getRandomSuccessor in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public AgentT getRandomPredecessor(AgentT ego)
MoreNetwork
getRandomPredecessor in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.getRandomPredecessor(java.lang.Object)
public boolean isSuccessor(AgentT alter,
AgentT ego)
MoreNetwork
isSuccessor in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.isSuccessor(java.lang.Object, java.lang.Object)public repast.simphony.context.space.graph.ContextJungNetwork<AgentT> getNetwork()
public void addNode(AgentT node)
MoreNetwork
addNode in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>public Graph<AgentT,EdgeT> getJungGraph()
MoreNetwork
getJungGraph in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public EdgeT getEdge(AgentT source,
AgentT target)
getEdge in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>
public MoreNetwork<AgentT,EdgeT> getGraphFilteredInstance(Graph<AgentT,EdgeT> graph,
String newName)
MoreNetworkGraph instance that contains subsets of
vertices and edges in the original MoreNetwork this method is applied to. For instance, such graphs may be a result
of a VertexPredicateFilter. The given graph needs to be of corresponding directedness! This (the original)
instance of MoreNetwork is not altered!
getGraphFilteredInstance in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork containing only vertices and edges contained in given graph objectde.cesr.more.basic.network.MoreNetwork#getEmptyInstance()public String toString()
toString in class ObjectObject.toString()public void reverseNetwork()
MoreNetwork
reverseNetwork in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.reverseNetwork()public Collection<EdgeT> getEdgesCollection()
getEdgesCollection in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>de.cesr.more.basic.network.MoreNetwork#getEdges()
public EdgeT addEdge(AgentT source,
AgentT target)
de.cesr.more.basic.network.MoreNetwork#connect(java.lang.Object)public void connect(EdgeT edge)
MoreNetwork
connect in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>edge - to add to the networkMoreNetwork.connect(de.cesr.more.basic.edge.MoreEdge)public void removeNode(AgentT node)
MoreNetwork
removeNode in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.removeNode(java.lang.Object)public boolean containsNode(AgentT node)
MoreNetwork
containsNode in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.containsNode(java.lang.Object)public void setEdgeFactory(MoreEdgeFactory<AgentT,EdgeT> edgeFac)
MoreNetworkMoreEdgeFactory that is used to connect agents.
setEdgeFactory in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.setEdgeFactory(de.cesr.more.building.edge.MoreEdgeFactory)public Class<? extends MoreNetworkBuilder<?,?>> getNetworkBuilderClass()
getNetworkBuilderClass in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.getNetworkBuilderClass()public void setNetworkBuilderClass(Class<? extends MoreNetworkBuilder<?,?>> builderClass)
setNetworkBuilderClass in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.setNetworkBuilderClass(java.lang.Class)public String getNetworkInfo()
MoreNetwork
getNetworkInfo in interface MoreNetwork<AgentT,EdgeT extends repast.simphony.space.graph.RepastEdge<AgentT> & MoreEdge<AgentT>>MoreNetwork.getNetworkInfo()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||