V
- the graph vertex typeE
- the graph edge typepublic class DefaultListenableGraph<V,E> extends GraphDelegator<V,E> implements ListenableGraph<V,E>, Cloneable
GraphListener
s and by
VertexSetListener
s. Operations on this graph "pass through" to the to the backing graph.
Any modification made to this graph or the backing graph is reflected by the other.
This graph does not pass the hashCode and equals operations through to the backing graph, but relies on Object's equals and hashCode methods.
GraphListener
,
VertexSetListener
,
Serialized FormDEFAULT_EDGE_WEIGHT
Constructor and Description |
---|
DefaultListenableGraph(Graph<V,E> g)
Creates a new listenable graph.
|
DefaultListenableGraph(Graph<V,E> g,
boolean reuseEvents)
Creates a new listenable graph.
|
Modifier and Type | Method and Description |
---|---|
E |
addEdge(V sourceVertex,
V targetVertex)
Creates a new edge in this graph, going from the source vertex to the target vertex, and
returns the created edge.
|
boolean |
addEdge(V sourceVertex,
V targetVertex,
E e)
Adds the specified edge to this graph, going from the source vertex to the target vertex.
|
void |
addGraphListener(GraphListener<V,E> l)
Adds the specified graph listener to this graph, if not already present.
|
boolean |
addVertex(V v)
Adds the specified vertex to this graph if not already present.
|
void |
addVertexSetListener(VertexSetListener<V> l)
Adds the specified vertex set listener to this graph, if not already present.
|
Object |
clone() |
protected void |
fireEdgeAdded(E edge,
V source,
V target,
double weight)
Notify listeners that the specified edge was added.
|
protected void |
fireEdgeRemoved(E edge,
V source,
V target,
double weight)
Notify listeners that the specified edge was removed.
|
protected void |
fireEdgeWeightUpdated(E edge,
V source,
V target,
double weight)
Notify listeners that the weight of an edge has changed.
|
protected void |
fireVertexAdded(V vertex)
Notify listeners that the specified vertex was added.
|
protected void |
fireVertexRemoved(V vertex)
Notify listeners that the specified vertex was removed.
|
boolean |
isReuseEvents()
Tests whether the
reuseEvents flag is set. |
boolean |
removeEdge(E e)
Removes the specified edge from the graph.
|
E |
removeEdge(V sourceVertex,
V targetVertex)
Removes an edge going from source vertex to target vertex, if such vertices and such edge
exist in this graph.
|
void |
removeGraphListener(GraphListener<V,E> l)
Removes the specified graph listener from this graph, if present.
|
boolean |
removeVertex(V v)
Removes the specified vertex from this graph including all its touching edges if present.
|
void |
removeVertexSetListener(VertexSetListener<V> l)
Removes the specified vertex set listener from this graph, if present.
|
void |
setEdgeWeight(E e,
double weight)
Assigns a weight to an edge.
|
void |
setReuseEvents(boolean reuseEvents)
If the
reuseEvents flag is set to true this class will reuse
previously fired events and will not create a new object for each event. |
addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getDelegate, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getType, getVertexSupplier, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, toString, vertexSet
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets
finalize, getClass, notify, notifyAll, wait, wait, wait
addVertex, containsEdge, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getType, getVertexSupplier, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, setEdgeWeight, vertexSet
public DefaultListenableGraph(Graph<V,E> g)
g
- the backing graph.public DefaultListenableGraph(Graph<V,E> g, boolean reuseEvents)
reuseEvents
flag is set to
true
this class will reuse previously fired events and will not create a new
object for each event. This option increases performance but should be used with care,
especially in multithreaded environment.g
- the backing graph.reuseEvents
- whether to reuse previously fired event objects instead of creating a new
event object for each event.IllegalArgumentException
- if the backing graph is already a listenable graph.public void setReuseEvents(boolean reuseEvents)
reuseEvents
flag is set to true
this class will reuse
previously fired events and will not create a new object for each event. This option
increases performance but should be used with care, especially in multithreaded environment.reuseEvents
- whether to reuse previously fired event objects instead of creating a new
event object for each event.public boolean isReuseEvents()
reuseEvents
flag is set. If the flag is set to
true
this class will reuse previously fired events and will not create a new
object for each event. This option increases performance but should be used with care,
especially in multithreaded environment.reuseEvents
flag.public E addEdge(V sourceVertex, V targetVertex)
GraphDelegator
null
.
The source and target vertices must already be contained in this graph. If they are not found
in graph IllegalArgumentException
is thrown.
This method creates the new edge e
using this graph's edge supplier (see
Graph.getEdgeSupplier()
). For the new edge to be added e
must not be
equal to any other edge the graph (even if the graph allows edge-multiplicity). More
formally, the graph must not contain any edge e2
such that
e2.equals(e)
. If such
e2
is found then the newly created edge e
is abandoned, the method leaves
this graph unchanged and returns null
.
If the underlying graph implementation's Graph.getEdgeSupplier()
returns
null
, then this method cannot create edges and throws an
UnsupportedOperationException
.
addEdge
in interface Graph<V,E>
addEdge
in class GraphDelegator<V,E>
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.
null
.Graph.getEdgeSupplier()
public boolean addEdge(V sourceVertex, V targetVertex, E e)
GraphDelegator
e
, to this graph if this graph contains no edge e2
such that
e2.equals(e)
. If this graph already contains such an edge, the call leaves this
graph unchanged and returns false. Some graphs do not allow edge-multiplicity. In
such cases, if the graph already contains an edge from the specified source to the specified
target, than this method does not change the graph and returns
false
. If the edge was added to the graph, returns
true
.
The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
addEdge
in interface Graph<V,E>
addEdge
in class GraphDelegator<V,E>
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.e
- edge to be added to this graph.Graph.addEdge(Object, Object)
,
Graph.getEdgeSupplier()
public void addGraphListener(GraphListener<V,E> l)
ListenableGraph
addGraphListener
in interface ListenableGraph<V,E>
l
- the listener to be added.public boolean addVertex(V v)
GraphDelegator
v
, to this graph if this graph contains no vertex
u
such that
u.equals(v)
. If this graph already contains such vertex, the call leaves this graph
unchanged and returns false. In combination with the restriction on constructors,
this ensures that graphs never contain duplicate vertices.public void addVertexSetListener(VertexSetListener<V> l)
ListenableGraph
addVertexSetListener
in interface ListenableGraph<V,E>
l
- the listener to be added.public E removeEdge(V sourceVertex, V targetVertex)
GraphDelegator
null
otherwise.removeEdge
in interface Graph<V,E>
removeEdge
in class GraphDelegator<V,E>
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.null
if no edge removed.public boolean removeEdge(E e)
GraphDelegator
e2
such that e2.equals(e)
, if the graph contains such edge. Returns
true if the graph contained the specified edge. (The graph will not contain the
specified edge once the call returns).
If the specified edge is null
returns
false
.
removeEdge
in interface Graph<V,E>
removeEdge
in class GraphDelegator<V,E>
e
- edge to be removed from this graph, if present.true
if and only if the graph contained the specified edge.public void removeGraphListener(GraphListener<V,E> l)
ListenableGraph
removeGraphListener
in interface ListenableGraph<V,E>
l
- the listener to be removed.public boolean removeVertex(V v)
GraphDelegator
u
such that u.equals(v)
, the call removes all edges that touch
u
and then removes u
itself. If no such u
is found,
the call leaves the graph unchanged. Returns true if the graph contained the
specified vertex. (The graph will not contain the specified vertex once the call returns).
If the specified vertex is null
returns
false
.
removeVertex
in interface Graph<V,E>
removeVertex
in class GraphDelegator<V,E>
v
- vertex to be removed from this graph, if present.true
if the graph contained the specified vertex; false
otherwise.public void setEdgeWeight(E e, double weight)
GraphDelegator
setEdgeWeight
in interface Graph<V,E>
setEdgeWeight
in class GraphDelegator<V,E>
e
- edge on which to set weightweight
- new weight for edgepublic void removeVertexSetListener(VertexSetListener<V> l)
ListenableGraph
removeVertexSetListener
in interface ListenableGraph<V,E>
l
- the listener to be removed.protected void fireEdgeAdded(E edge, V source, V target, double weight)
edge
- the edge that was added.source
- edge sourcetarget
- edge targetweight
- edge weightprotected void fireEdgeRemoved(E edge, V source, V target, double weight)
edge
- the edge that was removed.source
- edge sourcetarget
- edge targetweight
- edge weightprotected void fireEdgeWeightUpdated(E edge, V source, V target, double weight)
edge
- the edge whose weight has changed.source
- edge sourcetarget
- edge targetweight
- the edge weightprotected void fireVertexAdded(V vertex)
vertex
- the vertex that was added.protected void fireVertexRemoved(V vertex)
vertex
- the vertex that was removed.Copyright © 2019. All rights reserved.