V
 the graph vertex typeE
 the graph edge typepublic class AsUnmodifiableGraph<V,E> extends GraphDelegator<V,E> implements Serializable
UnsupportedOperationException
.
This graph does not pass the hashCode and equals operations through to the backing graph, but relies on Object's equals and hashCode methods. This graph will be serializable if the backing graph is serializable.
DEFAULT_EDGE_WEIGHT
Constructor and Description 

AsUnmodifiableGraph(Graph<V,E> g)
Creates a new unmodifiable graph based on the specified backing 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.

boolean 
addVertex(V v)
Adds the specified vertex to this graph if not already present.

GraphType 
getType()
Get the graph type.

boolean 
removeAllEdges(Collection<? extends E> edges)
Removes all the edges in this graph that are also contained in the specified edge collection.

Set<E> 
removeAllEdges(V sourceVertex,
V targetVertex)
Removes all the edges going from the specified source vertex to the specified target vertex,
and returns a set of all removed edges.

boolean 
removeAllVertices(Collection<? extends V> vertices)
Removes all the vertices in this graph that are also contained in the specified vertex
collection.

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.

boolean 
removeVertex(V v)
Removes the specified vertex from this graph including all its touching edges if present.

addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getDelegate, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toStringFromSets
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
containsEdge, setEdgeWeight
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 edgemultiplicity). 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.addEdge(Object, Object)
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 edgemultiplicity. 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, Object)
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.addVertex
in interface Graph<V,E>
addVertex
in class GraphDelegator<V,E>
v
 vertex to be added to this graph.Graph.addVertex(Object)
public boolean removeAllEdges(Collection<? extends E> edges)
Graph
Graph.removeEdge(Object)
method.removeAllEdges
in interface Graph<V,E>
removeAllEdges
in class AbstractGraph<V,E>
edges
 edges to be removed from this graph.Graph.removeAllEdges(Collection)
public Set<E> removeAllEdges(V sourceVertex, V targetVertex)
Graph
null
if any of the specified
vertices does not exist in the graph. If both vertices exist but no edge is found, returns an
empty set. This method will either invoke the Graph.removeEdge(Object)
method, or the
Graph.removeEdge(Object, Object)
method.removeAllEdges
in interface Graph<V,E>
removeAllEdges
in class AbstractGraph<V,E>
sourceVertex
 source vertex of the edge.targetVertex
 target vertex of the edge.null
if either vertex is not part of graphGraph.removeAllEdges(Object, Object)
public boolean removeAllVertices(Collection<? extends V> vertices)
Graph
Graph.removeVertex(Object)
method.removeAllVertices
in interface Graph<V,E>
removeAllVertices
in class AbstractGraph<V,E>
vertices
 vertices to be removed from this graph.Graph.removeAllVertices(Collection)
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.Graph.removeEdge(Object)
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.Graph.removeEdge(Object, Object)
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.Graph.removeVertex(Object)
public GraphType getType()
Copyright © 2018. All rights reserved.