org.graphstream.algorithm.measure
Class MaxSimultaneousEdgeCount
java.lang.Object
org.graphstream.stream.SinkAdapter
org.graphstream.algorithm.measure.MaxSimultaneousEdgeCount
- All Implemented Interfaces:
- org.graphstream.stream.AttributeSink, org.graphstream.stream.ElementSink, org.graphstream.stream.Sink
public class MaxSimultaneousEdgeCount
- extends org.graphstream.stream.SinkAdapter
A measure to get the maximum count of edges appearing simultaneously in the
dynamic graph. It works as a sink, so it just needs to be added to the source
providing graph informations.
For example, in the graph :
ae AB A B
ae BC B C
ae CD C D
de BC
ae DE D E
de CD
ae EF E F
ae FG F G
de EF
the maximal count of edges appearing simultaneously in the graph is 4.
Methods inherited from class org.graphstream.stream.SinkAdapter |
edgeAttributeAdded, edgeAttributeChanged, edgeAttributeRemoved, graphAttributeAdded, graphAttributeChanged, graphAttributeRemoved, nodeAdded, nodeAttributeAdded, nodeAttributeChanged, nodeAttributeRemoved, nodeRemoved, stepBegins |
MaxSimultaneousEdgeCount
public MaxSimultaneousEdgeCount()
reset
public void reset()
- Reset the max value.
getMaxSimultaneousEdgeCount
public int getMaxSimultaneousEdgeCount()
- Get the max value.
- Returns:
- the max count of edges appearing simultaneously in the graph
edgeAdded
public void edgeAdded(String sourceId,
long timeId,
String edgeId,
String node1,
String node2,
boolean directed)
- Specified by:
edgeAdded
in interface org.graphstream.stream.ElementSink
- Overrides:
edgeAdded
in class org.graphstream.stream.SinkAdapter
edgeRemoved
public void edgeRemoved(String sourceId,
long timeId,
String edgeId)
- Specified by:
edgeRemoved
in interface org.graphstream.stream.ElementSink
- Overrides:
edgeRemoved
in class org.graphstream.stream.SinkAdapter
graphCleared
public void graphCleared(String sourceId,
long timeId)
- Specified by:
graphCleared
in interface org.graphstream.stream.ElementSink
- Overrides:
graphCleared
in class org.graphstream.stream.SinkAdapter
Copyright © 2012. All Rights Reserved.